Archive for Mathematical Logic最新文献

In this article we investigate the complexity of isomorphisms between scattered linear orders of constructive ranks. We give the general upper bound and prove that this bound is sharp. Also, we construct examples showing that the categoricity level of a given scattered linear order can be an arbitrary ordinal from 3 to the upper bound, except for the case when the ordinal is the successor of a limit ordinal. The existence question of the scattered linear orders whose categoricity level equals the successor of a limit ordinal is still open.

We study Basic Arithmetic, (textsf{BA}) introduced by Ruitenburg (Notre Dame J Formal Logic 39:18–46, 1998). (textsf{BA}) is an arithmetical theory based on basic logic which is weaker than intuitionistic logic. We show that the class of the provably total recursive functions of (textsf{BA}) is a proper sub-class of the primitive recursive functions. Three extensions of (textsf{BA}), called (textsf{BA}+mathsf U), (mathsf {BA_{mathrm c}}) and (textsf{EBA}) are investigated with relation to their provably total recursive functions. It is shown that the provably total recursive functions of these three extensions of (textsf{BA}) are exactly the primitive recursive functions. Moreover, among other things, it is shown that the well-known MRDP theorem does not hold in (textsf{BA}), (textsf{BA}+mathsf U), (mathsf {BA_{mathrm c}}), but holds in (textsf{EBA}).

By using algebraic properties of (commutative unital) indecomposable polynomial rings we achieve results concerning their first-order theory, namely: interpretability of arithmetic and a uniform proof of undecidability of their full theory, both in the language of rings without parameters. This vastly extends the scope of a method due to Raphael Robinson, which deals with a restricted class of polynomial integral domains.

We investigate the problem of punctual (fully primitive recursive) presentability of algebraic structures up to primitive recursive and computable isomorphism. We show that for mono-unary structures and undirected graphs, if a structure is not punctually categorical then it has infinitely many punctually non-isomorphic punctual presentations. We also show that the punctual degrees of any computably almost rigid structure as well as the order ((mathbb {Z},<)) are dense. Finally we characterise the Boolean algebras which have a punctually 1-decidable presentation that is computably isomorphic to a 1-decidable presentation.

We formalize various counting principles and compare their strengths over (V^{0}). In particular, we conjecture the following mutual independence between:

• a uniform version of modular counting principles and the pigeonhole principle for injections,

• a version of the oddtown theorem and modular counting principles of modulus p, where p is any natural number which is not a power of 2,

• and a version of Fisher’s inequality and modular counting principles.

Then, we give sufficient conditions to prove them. We give a variation of the notion of PHP-tree and k-evaluation to show that any Frege proof of the pigeonhole principle for injections admitting the uniform counting principle as an axiom scheme cannot have o(n)-evaluations. As for the remaining two, we utilize well-known notions of p-tree and k-evaluation and reduce the problems to the existence of certain families of polynomials witnessing violations of the corresponding combinatorial principles with low-degree Nullstellensatz proofs from the violation of the modular counting principle in concern.

On the set of all first-order complete theories (T(sigma )) of a language (sigma ) we define a binary operation ({cdot }) by the rule: (Tcdot S= {{,textrm{Th},}}({Atimes Bmid Amodels T ,,text {and},, Bmodels S})) for any complete theories (T, Sin T(sigma )). The structure (langle T(sigma );cdot rangle ) forms a commutative semigroup. A subsemigroup S of (langle T(sigma );cdot rangle ) is called an absorption’s formula definable semigroup if there is a complete theory (Tin T(sigma )) such that (S=langle {Xin T(sigma )mid Xcdot T=T};cdot rangle ). In this event we say that a theory T absorbs S. In the article we show that for any absorption’s formula definable semigroup S the class ({{,textrm{Mod},}}(S)={Ain {{,textrm{Mod},}}(sigma )mid Amodels T_0,,text {for some},, T_0in S}) is axiomatizable, and there is an idempotent element (Tin S) that absorbs S. Moreover, ({{,textrm{Mod},}}(S)) is finitely axiomatizable provided T is finitely axiomatizable. We also prove that ({{,textrm{Mod},}}(S)) is a quasivariety (variety) provided T is an universal (a positive universal) theory. Some examples are provided.

It has long been known that (classical) Peano arithmetic is, in some strong sense, “equivalent” to the variant of (classical) Zermelo–Fraenkel set theory (including choice) in which the axiom of infinity is replaced by its negation. The intended model of the latter is the set of hereditarily finite sets. The connection between the theories is so tight that they may be taken as notational variants of each other. Our purpose here is to develop and establish a constructive version of this. We present an intuitionistic theory of the hereditarily finite sets, and show that it is definitionally equivalent to Heyting Arithmetic HA, in a sense to be made precise. Our main target theory, the intuitionistic small set theory SST is remarkably simple, and intuitive. It has just one non-logical primitive, for membership, and three straightforward axioms plus one axiom scheme. We locate our theory within intuitionistic mathematics generally.

We study the class of all strongly constructivizable models having (omega )-stable theories in a fixed finite rich signature. It is proved that the Tarski–Lindenbaum algebra of this class considered together with a Gödel numbering of the sentences is a Boolean (Sigma ^1_1)-algebra whose computable ultrafilters form a dense subset in the set of all ultrafilters; moreover, this algebra is universal with respect to the class of all Boolean (Sigma ^1_1)-algebras. This gives a characterization to the Tarski-Lindenbaum algebra of the class of all strongly constructivizable models with (omega )-stable theories.

In the context of a weak formal theory called Basic Intuitionistic Mathematics (textsf{BIM}), we study Brouwer’s Fan Theorem and a strong negation of the Fan Theorem, Kleene’s Alternative (to the Fan Theorem). We prove that the Fan Theorem is equivalent to contrapositions of a number of intuitionistically accepted axioms of countable choice and that Kleene’s Alternative is equivalent to strong negations of these statements. We discuss finite and infinite games and introduce a constructively useful notion of determinacy. We prove that the Fan Theorem is equivalent to the Intuitionistic Determinacy Theorem. This theorem says that every subset of Cantor space (2^omega ) is, in our constructively meaningful sense, determinate. Kleene’s Alternative is equivalent to a strong negation of a special case of this theorem. We also consider a uniform intermediate value theorem and a compactness theorem for classical propositional logic. The Fan Theorem is equivalent to each of these theorems and Kleene’s Alternative is equivalent to strong negations of them. We end with a note on ‘stronger’ Fan Theorems. The paper is a sequel to Veldman (Arch Math Logic 53:621–693, 2014).

We give several new equivalences of NIP for formulas and new proofs of known results using Talagrand (Ann Probab 15:837–870, 1987) and Haydon et al. (in: Functional Analysis Proceedings, The University of Texas at Austin 1987–1989, Lecture Notes in Mathematics, Springer, New York, 1991). We emphasize that Keisler measures are more complicated than types (even in the NIP context), in an analytic sense. Among other things, we show that for a first order theory T and a formula (phi (x,y)), the following are equivalent:

1. (i)

   (phi ) has NIP with respect to T.

2. (ii)

   For any global (phi )-type p(x) and any model M, if p is finitely satisfiable in M, then p is generalized DBSC definable over M. In particular, if M is countable, then p is DBSC definable over M. (Cf. Definition 3.7, Fact 3.8.)

3. (iii)

   For any global Keisler (phi )-measure (mu (x)) and any model M, if (mu ) is finitely satisfiable in M, then (mu ) is generalized Baire-1/2 definable over M. In particular, if M is countable, (mu ) is Baire-1/2 definable over M. (Cf. Definition 3.9.)

4. (iv)

   For any model M and any Keisler (phi )-measure (mu (x)) over M,

   $$begin{aligned} sup _{bin M}Big |frac{1}{k}sum _{i=1}^kphi (p_i,b)-mu (phi (x,b))Big |rightarrow 0, end{aligned}$$

   for almost every ((p_i)in S_{phi }(M)^{mathbb N}) with the product measure (mu ^{mathbb N}). (Cf. Theorem 4.4.)

5. (v)

   Suppose moreover that T is countable and NIP, then for any countable model M, the space of global M-finitely satisfied types/measures is a Rosenthal compactum. (Cf. Theorem 5.1.)