Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T05:09:27.837Z Has data issue: false hasContentIssue false

Pseudo-complements and ordinal logics based on consistency statements

Published online by Cambridge University Press:  12 March 2014

Robert A. Di Paola*
Affiliation:
University of California, Los Angeles

Extract

Following [1] we write {n} for the nth recursively enumerable (re) set; that is, {n} = {x|VyT(n, x, y)}. By a “pair (T, α)” we mean a consistent re extension T of Peano arithmetic P and an RE-formula α which numerates the non-logical axioms of T in P [4]. Given a pair (T, α) and a particular formula which binumerates the Kleene T predicate in P, there can be defined a primitive recursive function Nα such that and which has the additional property that {Nα(Nα(n))} = ø for all n.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable