- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Nonprovability of Certain Combinatorial Properties of Finite Trees
Journal of Symbolic Logic 55 (2):868-869 (1990)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Review: Stephen G. Simpson, Nonprovability of Certain Combinatorial Properties of Finite Trees. [REVIEW]W. Buchholz - 1990 - Journal of Symbolic Logic 55 (2):868-869.
A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
Combinatorial properties of filters and open covers for sets of real numbers.Claude Laflamme & Marion Scheepers - 1999 - Journal of Symbolic Logic 64 (3):1243-1260.
Computable categoricity of trees of finite height.Steffen Lempp, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Journal of Symbolic Logic 70 (1):151-215.
On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees.Dmitrij Skvortsov - 2004 - Studia Logica 77 (3):295 - 323.
Linguistics, Logic and Finite Trees.Patrick Blackburn & Wilfried Meyer-Viol - 1994 - Logic Journal of the IGPL 2 (1):3-29.
Finite algebras of relations are representable on finite sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
Boundedness theorems for dilators and ptykes.Alexander S. Kechris - 1991 - Annals of Pure and Applied Logic 52 (1-2):79-92.
Finite Tree Property for First-Order Logic with Identity and Functions.Merrie Bergmann - 2005 - Notre Dame Journal of Formal Logic 46 (2):173-180.
The isomorphism problem for ω-automatic trees.Dietrich Kuske, Jiamou Liu & Markus Lohrey - 2013 - Annals of Pure and Applied Logic 164 (1):30-48.
Definability in the h -quasiorder of labeled forests.Oleg V. Kudinov, Victor L. Selivanov & Anton V. Zhukov - 2009 - Annals of Pure and Applied Logic 159 (3):318-332.
On the inverse FPR problem: Quantum is classical. [REVIEW]George Svetlichny - 1990 - Foundations of Physics 20 (6):635-650.
Analytics
Added to PP
2015-02-05
Downloads
23 (#664,515)
6 months
5 (#629,136)
2015-02-05
Downloads
23 (#664,515)
6 months
5 (#629,136)
Historical graph of downloads
Citations of this work
Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
Equivalence between Fraïssé’s conjecture and Jullien’s theorem.Antonio Montalbán - 2006 - Annals of Pure and Applied Logic 139 (1):1-42.
Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results.Andreas Weiermann - 2005 - Annals of Pure and Applied Logic 136 (1):189-218.
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-l2pxr uwo