相关论文: Incompleteness of boundedly axiomatizable theories
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
After highlighting the cases in which the semantics of a language cannot be mechanically reproduced (in which case it is called inherent), the main epistemological consequences of the first incompleteness Theorem for the two fundamental…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…
We prove the equivalence of the semantic version of Tarski's theorem on the undefinability of truth with a semantic version of the Diagonal Lemma, and also show the equivalence of syntactic Tarski's Undefinability Theorem with a weak…
In this paper, we provide a fairly general self-reference-free proof of the Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of Truth.
In this paper we prove that no consistent finitely axiomatized theory one-dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the Second Incompleteness Theorem whose…
We prove the following version of the first incompleteness theorem that simultaneously strengthens Mostowski's theorem and Vaught's theorem: For any c.e. family $\{ T_i \}_{i \in \omega}$ of consistent extensions of Tarski, Mostowski and…
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
This paper examines a denumerable version of the nested-set theorem and derives from it a contradiction involving the formal consistency of the actual infinity assumed by the Axiom of Infinity.
We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…
By limiting the range of the predicate variables in a second-order language one may obtain restricted versions of second-order logic such as weak second-order logic or definable subset logic. In this note we provide an infinitary strongly…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We prove two completeness results, one for the extension of dependence logic by a monotone generalized quantifier Q with weak interpretation, weak in the meaning that the interpretation of Q varies with the structures. The second result…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…