A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY

DOI10.1073/PNAS.49.6.828MaRDI QIDQ5729293zbMATHOpenAlexWikidataFDO

Authors Raymond M. Smullyan

Publication date 1963

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.49.6.828

zbMATH Keywords

mathematical logic

Cited in

(20)

• Trees and nest structures
• Cut-elimination for quantified conditional logic
• The strategic balance of games in logic
• Relevant analytic tableaux
• Reducing higher-order theorem proving to a sequence of SAT problems
• Linear reasoning in modal logic
• A general schema for bilateral proof rules
• The foundations of Suslin logic
• Jean van Heijenoort's contributions to proof theory and its history
• Systematization of finite many-valued logics through the method of tableaux
• Uniform Gentzen systems
• Analytic tableaux for higher-order logic with choice
• Resolution in type theory
• Editor's introduction to Jean van Heijenoort, ``Historical development of modern logic
• On the model theory of denumerably long formulas with finite strings of quantifiers
• Reducing higher-order theorem proving to a sequence of SAT problems
• Formalized proof systems for propositional logic
• Σ₁ compactness for next admissible sets
• Fragments of first order logic, I: universal Horn logic
• Universal abstract consistency class and universal refutation

This page was built for publication: A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY

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