Axiomatizability by a schema

DOI10.2307/2270175zbMATH Open0191.29303OpenAlexW2030109211MaRDI QIDQ5585387FDOQ5585387

R. Vaught

Publication date: 1967

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2270175

zbMATH Keywords

algebraic logic, model theory

Cited In (19)

• A note on typed truth and consistency assertions
• On the degrees of unsolvability of modal predicate logics of provability
• Sequence encoding without induction
• On expandability of models of Peano arithmetic. III
• Weak sequential theories of finite full binary trees
• More on Systems of Truth and Predicative Comprehension
• Friedman-reflexivity
• The second incompleteness theorem and bounded interpretations
• A lattice of interpretability types of theories
• Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories
• Pairs, sets and sequences in first-order theories
• The theory of hereditarily bounded sets
• THE PERIPATETIC PROGRAM IN CATEGORICAL LOGIC: LEIBNIZ ON PROPOSITIONAL TERMS
• Cuts, consistency statements and interpretations
• AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW
• Pour-El's landscape
• Finite mathematics.
• CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN
• There are no minimal effectively inseparable theories

This page was built for publication: Axiomatizability by a schema

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585387)