Sciweavers

37 search results - page 3 / 8
» Preservation Theorems in Finite Model Theory
Sort
View
IGPL
2008
124views more  IGPL 2008»
13 years 7 months ago
The Ricean Objection: An Analogue of Rice's Theorem for First-order Theories
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
Igor Carboni Oliveira, Walter Alexandre Carnielli
LOGCOM
2010
123views more  LOGCOM 2010»
13 years 5 months ago
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
Peter Baumgartner, Ulrich Furbach, Björn Pelz...
STACS
2001
Springer
13 years 12 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
AML
2011
322views Mathematics» more  AML 2011»
13 years 2 months ago
A dedekind finite borel set
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...
Arnold W. Miller
ICALP
2007
Springer
14 years 1 months ago
Model Theory Makes Formulas Large
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...