All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 34 of 34

Showing per page

Preliminaries to Classical First Order Model Theory

Marco Caminati (2011)

Formalized Mathematics

First of a series of articles laying down the bases for classical first order model theory. These articles introduce a framework for treating arbitrary languages with equality. This framework is kept as generic and modular as possible: both the language and the derivation rule are introduced as a type, rather than a fixed functor; definitions and results regarding syntax, semantics, interpretations and sequent derivation rules, respectively, are confined to separate articles, to mark out the hierarchy...

Regular languages definable by Lindström quantifiers

Zoltán Ésik, Kim G. Larsen (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.

Regular languages definable by Lindström quantifiers

Zoltán Ésik, Kim G. Larsen (2010)

RAIRO - Theoretical Informatics and Applications

In our main result, we establish a formal connection between Lindström quantifiers with respect to regular languages and the double semidirect product of finite monoids with a distinguished set of generators. We use this correspondence to characterize the expressive power of Lindström quantifiers associated with a class of regular languages.

Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem

Marco Caminati (2011)

Formalized Mathematics

Fifth of a series of articles laying down the bases for classical first order model theory. This paper presents multiple themes: first it introduces sequents, rules and sets of rules for a first order language L as L-dependent types. Then defines derivability and provability according to a set of rules, and gives several technical lemmas binding all those concepts. Following that, it introduces a fixed set D of derivation rules, and proceeds to convert them to Mizar functorial cluster registrations...

The elementary-equivalence classes of clopen algebras of P-spaces

Brian Wynne (2008)

Fundamenta Mathematicae

Two Boolean algebras are elementarily equivalent if and only if they satisfy the same first-order statements in the language of Boolean algebras. We prove that every Boolean algebra is elementarily equivalent to the algebra of clopen subsets of a normal P-space.

The number of countable isomorphism types of complete extensions of the theory of Boolean algebras

Paul Iverson (1991)

Colloquium Mathematicae

There is a conjecture of Vaught [17] which states: Without The Generalized Continuum Hypothesis one can prove the existence of a complete theory with exactly ω 1 nonisomorphic, denumerable models. In this paper we show that there is no such theory in the class of complete extensions of the theory of Boolean algebras. More precisely, any complete extension of the theory of Boolean algebras has either 1 or 2 ω nonisomorphic, countable models. Thus we answer this conjecture in the negative for any complete...

Currently displaying 21 – 34 of 34

Previous Page 2