On Complexity of Complete First‐Order Theories

Mathematical Logic Quarterly 28 (8‐12):93-136 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Inductive inference in the limit of empirically adequate theories.Bernhard Lauth - 1995 - Journal of Philosophical Logic 24 (5):525 - 548.
Completeness and categoricity: Frege, gödel and model theory.Stephen Read - 1997 - History and Philosophy of Logic 18 (2):79-93.
The Automated Discovery of Universal Theories.Kevin T. Kelly - 1986 - Dissertation, University of Pittsburgh
Descriptive complexity theories.Joerg Flum - 2003 - Theoria 18 (1):47-58.
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.
Complexity theories, social theory, and the question of social complexity.Peter Stewart - 2001 - Philosophy of the Social Sciences 31 (3):323-360.
Complexity and sustainability.Jennifer Wells - 2013 - New York: Routledge.
An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
Complete theories with only universal and existential axioms.A. H. Lachlan - 1987 - Journal of Symbolic Logic 52 (3):698-711.

Analytics

Added to PP
2013-12-01

Downloads
9 (#1,224,450)

6 months
6 (#504,917)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations