An Application of Graphical Enumeration to PA
- 期刊名称The Journal of Symbolic Logic
- 作者Andreas Weiermann
- 卷第68卷
- 期第1期
- 印刷ISSN0022-4812
- 文件大小387.65KB
- 发表时间2003-03
- DOI10.2307/4147731
- 页码5-16
Tarskian Structured Consequence Relations and Functional CompletenessHeinrich Wansing · 1995
Substructural logicsHeinrich Wansing · 1996
Informational interpretation of substructural propositional logicsHeinrich Wansing · 1993
Book ReviewWansing Heinrich · 2006
Connectives Stranger than TonkHeinrich Wansing · 2006
Editorial IntroductionPhilip Kremer; Heinrich Wansing · 2010
Editorial Introduction. Truth Values: Part IYaroslav Shramko; Heinrich Wansing · 2009
The Slingshot Argument and Sentential IdentityYaroslav Shramko; Heinrich Wansing · 2009
Computability and λ-DefinabilityA. M. Turing · The Journal of Symbolic Logic · 1937
Definability and Decision Problems in ArithmeticJulia Robinson · The Journal of Symbolic Logic · 1949
Arithmetical Problems and Recursively Enumerable PredicatesMartin Davis · The Journal of Symbolic Logic · 1953
The Interpretability Logic of Peano ArithmeticAlessandro Berarducci · The Journal of Symbolic Logic · 1990
Steps Toward a Constructive NominalismNelson Goodman and W. V. Quine · The Journal of Symbolic Logic · 1947
A Completeness Theorem in Modal LogicSaul A. Kripke · The Journal of Symbolic Logic · 1959
Models and RealityHilary Putnam · The Journal of Symbolic Logic · 1980
A Theory of Restricted Quantification ITheodore Hailperin · The Journal of Symbolic Logic · 1957