ON A QUESTION OF KRAJEWSKI’S
@article{Pakhomov2017ONAQ, title={ON A QUESTION OF KRAJEWSKI’S}, author={Fedor Pakhomov and Albert Visser}, journal={The Journal of Symbolic Logic}, year={2017}, volume={84}, pages={343 - 358} }
Abstract In this paper, we study finitely axiomatizable conservative extensions of a theory U in the case where U is recursively enumerable and not finitely axiomatizable. Stanisław Krajewski posed the question whether there are minimal conservative extensions of this sort. We answer this question negatively. Consider a finite expansion of the signature of U that contains at least one predicate symbol of arity ≥ 2. We show that, for any finite extension α of U in the expanded language that is…
2 Citations
The small‐is‐very‐small principle
- Mathematics, Computer ScienceMath. Log. Q.
- 2019
The central result of this paper is the small‐is‐very‐small principle for restricted sequential theories, which says roughly that whenever the given theory shows that a definable property has a small witness, then it shows that theProperty has a very small witness: i.e., a witness below a given standard number.
Enayat Theories
- Mathematics, PhilosophyFLAP
- 2021
In this paper we study solution attempts for a problem posed by Ali Enayat: can there be a finitely axiomatized consistent sequential theory that interprets itself plus the (sentential or…
References
SHOWING 1-10 OF 19 REFERENCES
Finite Axiomatizability using additional predicates
- PhilosophyJournal of Symbolic Logic
- 1958
This paper supplements the work of Kleene [9] on axiomatizability of theories with identity and notes that, as a consequence of a recent result of Tarski, the new additional predicates required can be reduced to one binary predicate in (1), (2), and (3).
Theories of linear order
- Mathematics
- 1974
LetT be a complete theory of linear order; the language ofT may contain a finite or a countable set of unary predicates. We prove the following results. (i) The number of nonisomorphic countable…
Bounded Arithmetic と計算量の根本問題
- Mathematics
- 1996
59.4 T h e C u t Elimination Theorem for Second Order Logic 171 (respectively, v . ) . In particular, (a) guarantees t h a t *"-PIND or c ~ ' ~ I N D , and C ~ ' ~ C R inferences are still valid…
The Interpretation Existence Lemma
- Mathematics
- 2017
The present paper contains a fairly detailed verification of a reasonably general form of the Interpretation Existence Lemma. In first approximation, this lemma tells us that if a theory U proves the…
Relative Truth Definability of Axiomatic Truth Theories
- PhilosophyThe Bulletin of Symbolic Logic
- 2010
Abstract The present paper suggests relative truth definability as a tool for comparing conceptual aspects of axiomatic theories of truth and gives an overviewof recent developments of axiomatic…
Metamathematics of First-Order Arithmetic
- MathematicsPerspectives in mathematical logic
- 1993
This chapter discusses Arithmetic as Number Theory, Set Theory and Logic, Fragments and Combinatorics, and Models of Fragments of Arithmetic.
Admissible sets and structures
- Education
- 1978
Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did the teacher. Some books are fully read in a week and we need the…
Finite Axiomatizability of Theories in the Predicate Calculus Using Additional Predicate Symbols
- Mathematics, Computer Science
- 1952