A complete theory of everything: Satisfiability in the universal domain

Abstract

Here we take the view that LPC(=) is applicable to structures whose domain is too large to be a set. This is not just a matter of class theory versus set theory, although it can be interpreted as such, and this interpretation is discussed briefly at the end.

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

My notes

Similar books and articles

A complete theory of everything: Satisfiability in the universal domain Harvey M. Friedman october 10, 1999 [email protected]. [REVIEW]Harvey Friedman - manuscript
A complete theory of everything: Satisfiability in the universal domain Harvey M. Friedman october 10, 1999 [email protected] www.math.ohio-state.Edu/~Friedman/. [REVIEW]Harvey Friedman - manuscript
Constructibility and Decidability versus Domain Independence and Absoluteness.Arnon Avron - unknown
From Domains Towards a Logic of Universals: A Small Calculus for the Continuous Determination of Worlds.Dr Claus Brillowski - unknown
The Principle of the Common Cause, the Causal Markov Condition, and Quantum Mechanics: Comments on Cartwright.Iain Martel - 2008 - In Luc Bovens, Carl Hoefer & Stephan Hartmann (eds.), Nancy Cartwright’s Philosophy of Science. Routledge. pp. 242-262.
Domains of Discourse.Philip Hugly & Charles Sayward - 1987 - Logique Et Analyse 117 (17):173-176.
Constrained semantic transference: A formal theory of metaphors.Bipin Indurkhya - 1986 - Synthese 68 (3):515 - 551.
Second order logic or set theory?Jouko Väänänen - 2012 - Bulletin of Symbolic Logic 18 (1):91-121.
Model companions for finitely generated universal horn classes.Stanley Burris - 1984 - Journal of Symbolic Logic 49 (1):68-74.
Domain of discourse.Christopher Gauker - 1997 - Mind 106 (421):1-32.
Complexity Results for Modal Dependence Logic.Peter Lohmann & Heribert Vollmer - 2013 - Studia Logica 101 (2):343-366.
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
On dedekind complete o-minimal structures.Anand Pillay & Charles Steinhorn - 1987 - Journal of Symbolic Logic 52 (1):156-164.

Analytics

Added to PP
2010-12-22

Downloads
168 (#110,766)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

First-order modal logic in the necessary framework of objects.Peter Fritz - 2016 - Canadian Journal of Philosophy 46 (4-5):584-609.

Add more citations

References found in this work

No references found.

Add more references