- 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
Monadic generalized spectra
Mathematical Logic Quarterly 21 (1):89-96 (1975)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Some Remarks on Generalized Spectra.L. Lovász & P. Gács - 1976 - Mathematical Logic Quarterly 23 (36):547-554.
Fagin Ronald. Probabilities on finite models.W. Taylor - 1985 - Journal of Symbolic Logic 50 (4):1073-1076.
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second‐Order Logic.Iain A. Stewart - 1997 - Mathematical Logic Quarterly 43 (1):1-21.
On the Undecidability of Monadic Modal Predicate Logic.Akira Nakamura - 1970 - Mathematical Logic Quarterly 16 (3):257-260.
Monadic Characterizations in Nonstandard Topology.Terry A. McKee - 1980 - Mathematical Logic Quarterly 26 (25-27):395-397.
Axiomatization of the monadic theory of ordinals < ω2.Charles Zaiontz - 1983 - Mathematical Logic Quarterly 29 (6):337-356.
Deterministic automata and the monadic theory of ordinals < ω2.J. Richard Büchi & Charles Zaiontz - 1983 - Mathematical Logic Quarterly 29 (5):313-336.
Bi‐embeddability spectra and bases of spectra.Ekaterina Fokina, Dino Rossegger & Luca San Mauro - 2019 - Mathematical Logic Quarterly 65 (2):228-236.
Undecidable Extensions of Monadic Second Order Successor Arithmetic.Dirk Siefkes - 1971 - Mathematical Logic Quarterly 17 (1):385-394.
Analytics
Added to PP
2013-11-02
Downloads
27 (#609,703)
6 months
5 (#710,311)
2013-11-02
Downloads
27 (#609,703)
6 months
5 (#710,311)
Historical graph of downloads
Author's Profile
Citations of this work
Generalized quantifiers and pebble games on finite structures.Phokion G. Kolaitis & Jouko A. Väänänen - 1995 - Annals of Pure and Applied Logic 74 (1):23-75.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Almost everywhere equivalence of logics in finite model theory.Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto - 1996 - Bulletin of Symbolic Logic 2 (4):422-443.
Games and Cardinalities in Inquisitive First-Order Logic.Gianluca Grilletti & Ivano Ciardelli - 2023 - Review of Symbolic Logic 16 (1):241-267.
References found in this work
Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität.Günter Asser - 1955 - Mathematical Logic Quarterly 1 (4):252-263.
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-68866f4b87-dxklk uwo