Axiomatizable (original) (raw)
Related papers
Abstract elementary classes and infinitary logics
Annals of Pure and Applied Logic, 2008
The elementary theory of the natural lattice is finitely axiomatizable
Notre Dame Journal of Formal Logic - NDJFL, 1989
Infinitary logics and abstract elementary classes
Proceedings of the American Mathematical Society
A Note on Finiteness in the Predicative Foundations of Arithmetic
Journal of Philosophical Logic, 1999
An Arithmetical-like Theory of Hereditarily Finite Sets
Anais do II Workshop Brasileiro de Lógica (WBL 2021), 2021
Internal End-Extensions of Peano Arithmetic and a Problem of Gaifman
Journal of the London Mathematical Society, 1976
Classical mereology is not elementarily axiomatizable
Logic and Logical Philosophy, 2015
Degrees of insolubility of extensions of arithmetic by true propositions
Russian Mathematical Surveys, 1988
A standard model of Peano arithmetic with no conservative elementary extension
Annals of Pure and Applied Logic, 2008
A Note on Induction, Abstraction, and Dedekind-Finiteness
2011
µ-ABSTRACT ELEMENTARY CLASSES AND OTHER GENERALIZATIONS
Submodels and definable points in models of Peano arithmetic
Notre Dame Journal of Formal Logic, 1983
Strong axioms of infinity and elementary embeddings
Annals of Mathematical Logic, 1978
Superstability in abstract elementary classes
2018
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
Transactions of the American Mathematical Society, 1980
On Certain Axiomatizations of Arithmetic of Natural and Integer Numbers
Axioms
Expressibility in the elementary theory of recursively enumerable sets with realizability logic
Algebra and Logic, 1981
Decidable Fragments of the Simple Theory of Types with Infinity and NF
Notre Dame Journal of Formal Logic, 2017
The elementary theory of the recursively enumerable degrees is not 0-categorical
Advances in Mathematics, 1984
Completeness theorems, incompleteness theorems and models of arithmetic
Transactions of the American Mathematical Society, 1978
Models and types of Peano's arithmetic
Annals of Mathematical Logic, 1976
Undefinable classes and definable elements in models of set theory and arithmetic
Proceedings of The American Mathematical Society, 1988
Excellent Abstract Elementary Classes Are Tame
arXiv (Cornell University), 2005
On end extensions of models of subsystems of peano arithmetic
Theoretical Computer Science, 2001
Decidability of the class of all the rings : A problem of Ax
Forum of Mathematics, Sigma
Ehrenfeucht-Mostowski models in abstract elementary classes
Contemporary Mathematics, 2005
Non-finite-axiomatizability results in algebraic logic
Journal of Symbolic Logic, 1992
Konrad Zdanowski, Marcin Mostowski
Fundamenta Informaticae
Categoricity in abstract elementary classes with no maximal models
Annals of Pure and Applied Logic, 1999
On decidability and axiomatizability of some ordered structures
Soft Computing
Journal of Symbolic Logic, 2003
On the Hierarchy of Intuitionistic Bounded Arithmetic
Journal of Logic and Computation, 2007
Definability, automorphisms, and infinitary languages
Lecture Notes in Mathematics, 1968
Enumeration Reducibility and Computable Structure Theory
Computability and Complexity, 2016
On Certain Extentions of the Arithmetic of Addition of Natural Numbers
Mathematics of the USSR – Izvestia. 15:2, 1980