- 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
Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets
Journal of Symbolic Logic 46 (1):101 - 120 (1981)
Abstract
Every ℵ 0 -categorical partially ordered set of finite width has a finitely axiomatizable theory. Every ℵ 0 -categorical partially ordered set of finite weak width has a decidable theory. This last statement constitutes a major portion of the complete (with three exceptions) characterization of those finite partially ordered sets for which any ℵ 0 -categorical partially ordered set not embedding one of them has a decidable theoryLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Finite partially-ordered quantification.Wilbur John Walkoe Jr - 1970 - Journal of Symbolic Logic 35 (4):535-555.
Partially ordered sets and the independence property.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (2):396-401.
The Superintuitionistic Predicate Logic of Finite Kripke Frames Is Not Recursively Axiomatizable.Dmitrij Skvortsov - 2005 - Journal of Symbolic Logic 70 (2):451 - 459.
Small theories of Boolean ordered o-minimal structures.Roman Wencel - 2002 - Journal of Symbolic Logic 67 (4):1385-1390.
On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees.Dmitrij Skvortsov - 2004 - Studia Logica 77 (3):295 - 323.
Partially ordered quantifiers vs. partially ordered ideas.Jaakko Hintikka - 1976 - Dialectica 30 (1):89--99.
Supersimple ω-categorical groups and theories.David M. Evans & Frank O. Wagner - 2000 - Journal of Symbolic Logic 65 (2):767-776.
Reconsidering ordered pairs.Dana Scott & Dominic McCarty - 2008 - Bulletin of Symbolic Logic 14 (3):379-397.
Real functions on the family of all well-ordered subsets of a partially ordered set.Stevo Todorčević - 1983 - Journal of Symbolic Logic 48 (1):91-96.
Decidability and ℵ0-categoricity of theories of partially ordered sets.James H. Schmerl - 1980 - Journal of Symbolic Logic 45 (3):585 - 611.
Analytics
Added to PP
2009-01-28
Downloads
44 (#354,888)
6 months
11 (#226,317)
2009-01-28
Downloads
44 (#354,888)
6 months
11 (#226,317)
Historical graph of downloads
Citations of this work
The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
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-slfdl uwo