- 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
Almost sure theories
Annals of Mathematical Logic 18 (2):91 (1980)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Simple structures axiomatized by almost sure theories.Ove Ahlman - 2016 - Annals of Pure and Applied Logic 167 (5):435-456.
The theories of Baldwin–Shi hypergraphs and their atomic models.Danul K. Gunatilleka - 2021 - Archive for Mathematical Logic 60 (7):879-908.
Almost-disjoint sets the dense set problem and the partition calculus.James E. Baumgartner - 1976 - Annals of Mathematical Logic 9 (4):401-439.
Recursive models for constructive set theories.N. Beeson - 1982 - Annals of Mathematical Logic 23 (2/3):127.
Recursive models for constructive set theories.M. Beeson - 1982 - Annals of Mathematical Logic 23 (2-3):127-178.
Reducibility orderings: Theories, definability and automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
Universal equational theories and varieties of algebras.Don Pigozzi - 1979 - Annals of Mathematical Logic 17 (1):117.
Finite injury arguments in infinite computation theories.Viggo Stoltenberg-Hansen - 1979 - Annals of Mathematical Logic 16 (1):57-80.
Analytics
Added to PP
2014-01-17
Downloads
23 (#949,443)
6 months
7 (#736,605)
2014-01-17
Downloads
23 (#949,443)
6 months
7 (#736,605)
Historical graph of downloads
Citations of this work
Asymptotic conditional probabilities: The non-unary case.Adam J. Grove, Joseph Y. Halpern & Daphne Koller - 1996 - Journal of Symbolic Logic 61 (1):250-276.
Nonconvergence, undecidability, and intractability in asymptotic problems.Kevin J. Compton, C. Ward Henson & Saharon Shelah - 1987 - Annals of Pure and Applied Logic 36:207.
Quantifier Elimination for a Class of Intuitionistic Theories.Ben Ellison, Jonathan Fleischmann, Dan McGinn & Wim Ruitenburg - 2008 - Notre Dame Journal of Formal Logic 49 (3):281-293.
An undecidable problem in finite combinatorics.Kevin J. Compton - 1984 - Journal of Symbolic Logic 49 (3):842-850.
References found in this work
Turing machines and the spectra of first-order formulas.Neil D. Jones & Alan L. Selman - 1974 - Journal of Symbolic Logic 39 (1):139-150.
An Application of Games to the Completeness Problem for Formalized Theories.A. Ehrenfeucht - 1967 - Journal of Symbolic Logic 32 (2):281-282.
Reducibility Among Combinatorial Problems.Richard M. Karp, Raymond E. Miller & James W. Thatcher - 1975 - Journal of Symbolic Logic 40 (4):618-619.
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-648784bb4d-2w72m uwo