A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY
From MaRDI portal
Publication:5729293
DOI10.1073/PNAS.49.6.828zbMATH Open0118.24901OpenAlexW2046306553WikidataQ34396441 ScholiaQ34396441MaRDI QIDQ5729293FDOQ5729293
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
Cited In (20)
- Relevant analytic tableaux
- Linear reasoning in modal logic
- Cut-elimination for quantified conditional logic
- Reducing higher-order theorem proving to a sequence of SAT problems
- Universal abstract consistency class and universal refutation
- Σ1 compactness for next admissible sets
- Reducing higher-order theorem proving to a sequence of SAT problems
- The strategic balance of games in logic
- The foundations of Suslin logic
- Fragments of first order logic, I: universal Horn logic
- Analytic tableaux for higher-order logic with choice
- Resolution in type theory
- Editor's introduction to Jean van Heijenoort, ``Historical development of modern logic
- Jean van Heijenoort's contributions to proof theory and its history
- Uniform Gentzen systems
- Systematization of finite many-valued logics through the method of tableaux
- On the model theory of denumerably long formulas with finite strings of quantifiers
- A general schema for bilateral proof rules
- Title not available (Why is that?)
- Trees and nest structures
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)
