- 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
On finite rigid structures
Journal of Symbolic Logic 61 (2):549-562 (1996)
Abstract
The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L ω ∞,ω formula with counting quantifiers defines a linear orderLinks
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
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
Epsilon-logic is more expressive than first-order logic over finite structures.Martin Otto - 2000 - Journal of Symbolic Logic 65 (4):1749-1757.
Modal logic over finite structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
The First-Order Structure of Weakly Dedekind-Finite Sets.A. C. Walczak-Typke - 2005 - Journal of Symbolic Logic 70 (4):1161 - 1170.
Finite conformal hypergraph covers and Gaifman cliques in finite structures.Ian Hodkinson & Martin Otto - 2003 - Bulletin of Symbolic Logic 9 (3):387-405.
Quasi-modal equivalence of canonical structures.Robert Goldblatt - 2001 - Journal of Symbolic Logic 66 (2):497-508.
Random models and the gödel case of the decision problem.Yuri Gurevich & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (4):1120-1124.
Analytics
Added to PP
2009-01-28
Downloads
189 (#100,272)
6 months
12 (#171,024)
2009-01-28
Downloads
189 (#100,272)
6 months
12 (#171,024)
Historical graph of downloads
Citations of this work
How to define a linear order on finite models.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1997 - Annals of Pure and Applied Logic 87 (3):241-267.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
Canonization for two variables and puzzles on the square.Martin Otto - 1997 - Annals of Pure and Applied Logic 85 (3):243-282.
Finite variable logics in descriptive complexity theory.Martin Grohe - 1998 - Bulletin of Symbolic Logic 4 (4):345-398.
Finite and Infinite Model Theory-A Historical Perspective.John Baldwin - 2000 - Logic Journal of the IGPL 8 (5):605-628.
References found in this work
How to define a linear order on finite models.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1997 - Annals of Pure and Applied Logic 87 (3):241-267.
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-6d9b7f7c4c-tstkh uwo