The consistency of some 4-stratified subsystem of NF including NF3

1985 ◽  
Vol 50 (2) ◽  
pp. 407-411 ◽  
Author(s):  
Maurice Boffa ◽  
Paolo Casalegno

As is well known, NF is a first-order theory whose language coincides with that of ZF. The nonlogical axioms of the theory are: Extensionality. (x)(y)[(z)(z ∈ x ↔ z ∈ y) → x = y].Comprehension. (Ex)(y)(y ∈ x ↔ ψ) for every stratified ψ in which x does not occur free (a formula of NF is said to be stratified if it can be turned into a formula of the simple theory of types by adding type indices (natural numbers ≥ 0) to its variables).Before stating our result, a few preliminaries are in order. Let T be the simple theory of types. If ψ is a formula of T, we denote by ψ+ the formula obtained from ψ by raising all type indices by 1. T* is the result of adding to T every axiom of the form ψ ↔ ψ+. A formula of T is n-stratified (n > 0) if it does not contain any type index ≥ n. A formula of NF is n-stratified if it can be turned into an n-stratified formula of T by adding type indices to its variables. (In practice, we shall allow ourselves to confuse an n-stratified formula of T with the corresponding n-stratified formula of NF). For n > 0, Tn (resp. ) is the subtheory of T (resp. T*) containing only n-stratified formulae. For n > 0, NFn is the subtheory of NF generated by those axioms of NF which are n-stratified. Let = 〈M0, M1,…,=, ∈〉 be a model of T.

1976 ◽  
Vol 41 (3) ◽  
pp. 695-696 ◽  
Author(s):  
J. R. Shoenfield

In [3], Martin computed the degrees of certain classes of RE sets. To state the results succinctly, some notation is useful.If A is a set (of natural numbers), dg(A) is the (Turing) degree of A. If A is a class of sets, dg(A) = {dg(A): A ∈ A). Let M be the class of maximal sets, HHS the class of hyperhypersimple sets, and DS the class of dense simple sets. Martin showed that dg(M), dg(HHS), and dg(DS) are all equal to the set H of RE degrees a such that a′ = 0″.Let M* be the class of coinfinite RE sets having no superset in M; and define HHS* and DS* similarly. Martin showed that dg(DS*) = H. In [2], Lachlan showed (among other things) that dg(M*)⊆K, where K is the set of RE degrees a such that a″ > 0″. We will show that K ⊆ dg (HHS*). Since maximal sets are hyperhypersimple, this gives dg(M*) = dg (HHS*) = K.These results suggest a problem. In each case in which dg(A) has been calculated, the set of nonzero degrees in dg(A) is either H or K or the empty set or the set of all nonzero RE degrees. Is this always the case for natural classes A? Natural here might mean that A is invariant under all automorphisms of the lattice of RE sets; or that A is definable in the first-order theory of that lattice; or anything else which seems reasonable.


1993 ◽  
Vol 58 (2) ◽  
pp. 672-687 ◽  
Author(s):  
P. T. Bateman ◽  
C. G. Jockusch ◽  
A. R. Woods

AbstractIt is shown, assuming the linear case of Schinzel's Hypothesis, that the first-order theory of the structure 〈ω; +, P〉, where P is the set of primes, is undecidable and, in fact, that multiplication of natural numbers is first-order definable in this structure. In the other direction, it is shown, from the same hypothesis, that the monadic second-order theory of 〈ω S, P〉 is decidable, where S is the successor function. The latter result is proved using a general result of A. L. Semënov on decidability of monadic theories, and a proof of Semënov's result is presented.


2004 ◽  
Vol 69 (3) ◽  
pp. 641-662 ◽  
Author(s):  
Itay Ben-Yaacov

Abstract.We prove that for every simple theory T (or even simple thick compact abstract theory) there is a (unique) compact abstract theory whose saturated models are the lovely pairs of T. Independence-theoretic results that were proved in [5] when is a first order theory are proved for the general case: in particular is simple and we characterise independence.


2009 ◽  
Vol 09 (01) ◽  
pp. 1-20 ◽  
Author(s):  
HANS ADLER

A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be closely related to modular pairs in the lattice of algebraically closed sets.


1998 ◽  
Vol 63 (1) ◽  
pp. 50-50 ◽  
Author(s):  
M. Boffa

Let P be the set of prime numbers. Theorem 1 of [1] shows that the linear case of Schinzel's Hypothesis (H) implies that multiplication is definable in 〈ω,+,P〉 and therefore that the first-order theory of this structure is undecidable. Let m be any fixed natural number >2, let R be the set of natural numbers <m which are prime to m, and let r be any fixed element of R. The setis infinite (Dirichlet). Theorem 1 of [1] can be improved as follows:Proposition. The linear case of Schinzel's Hypothesis (H) implies that multiplication is definable in 〈ω,+,Pm,r〉 and therefore that the first-order theory of this structure is undecidable.Proof. We follow [1] with the following new ingredients. Let k be the number of elements of R, i.e. k = ϕ(m) where ϕ is Euler's totient function. Since k is even, the polynomial g(n) = nk + n satisfies g(0) = g(−1) = 0, so (by Lemma 1 of [1]) it follows from the linear case of (H) that there are natural numbers al (l ϵ ω) such that al+g(0), al+g(1),…, al+g(l) are consecutive primes. Since R is finite, we may assume that all the al's have the same residue t in R, so that al+g(i) ≡ t+1+i (mod m) for i ϵ R. This implies that the function t+1+i (reduced mod m) gives a permutation of R, so we can find s ϵ R such that al+g(s) ≡ r (mod m). Consider the polynomial h(n) = g(s + mn) and let bl = as+ml. Then bl + h(0), bl + h(1),…, bl + h(l) are elements of Pm,r. They are not necessarily consecutive elements of Pm,r, but they are separated by a fixed number of elements of Pm,r. This implies that {h(n) ∣ n ϵ ω} is definable in 〈ω,+,Pm,r〉(by adapting the proof of Theorem 1 of [1]), and the result follows.


2021 ◽  
pp. 104745
Author(s):  
Albert Garreta ◽  
Robert D. Gray

Computability ◽  
2019 ◽  
Vol 8 (3-4) ◽  
pp. 347-358
Author(s):  
Matthew Harrison-Trainor

2015 ◽  
Vol 57 (2) ◽  
pp. 157-185 ◽  
Author(s):  
Peter Franek ◽  
Stefan Ratschan ◽  
Piotr Zgliczynski

Sign in / Sign up

Export Citation Format

Share Document