Random variables and integral logic

We study model theory of random variables using finitary integral logic. We prove definability of some probability concepts such as having F(u) as distribution function, independence and martingale property. We then deduce Kolmogorov's existence theorem from the compactness theorem.     

Birkhoff Completeness in Institutions

We develop an abstract proof calculus for logics whose sentences are ‘Horn sentences’ of the form: and prove an institutional generalization of Birkhoff completeness theorem. This result is then applied to the particular cases of Horn clauses logic, the ‘Horn fragment’ of preorder algebras, order-sorted algebras and partial algebras and their infinitary variants. the restriction of a logic to Horn sentences     

Algebraic Characterizations for Universal Fragments of Logic

In this paper we address our efforts to extend the well-known connection in equational logic between equational theories and fully invariant congruences to other–possibly infinitary–logics. In the special case of algebras, this problem has been formerly treated by H. J. Hoehnke [10] and R. W. Quackenbush [14]. Here we show that the connection extends at least up to the universal fragment of logic. Namely, we establish that the concept of (infinitary) universal theory matches the abstract notion of fully invariant system. We also prove that, inside this wide group of theories, the ones which are strict universal Horn correspond to fully invariant closure systems, whereas those which are universal atomic can be characterized as principal fully invariant systems.     

Beth’s theorem in cardinality logics

We prove that the Beth definability theorem fails for a comprehensive class of first-order logics with cardinality quantifiers. In particular, we give a counterexample to Beth’s theorem forL(Q), which is finitary first-order logic (with identity) augmented with the quantifier “there exists uncountably many”. This research was partially supported by NSF GP29254.     

The theorems of Beth and craig in abstract model theory,III: Δ-logics and infinitary logics

We give a general technique on how to produce counterexamples to Beth's definability (and weak definability) theorem. The method is then applied for various infinitary, cardinality quantifier logics and Δ-closure of such logics.     

Axiomatisability and hardness for universal Horn classes of hypergraphs

We consider hypergraphs as symmetric relational structures. In this setting, we characterise finite axiomatisability for finitely generated universal Horn classes of loop-free hypergraphs. An Ehrenfeucht–Fraïssé game argument is employed to show that the results continue to hold when restricted to first order definability amongst finite structures. We are also able to show that every interval in the homomorphism order on hypergraphs contains a continuum of universal Horn classes and conclude the article by characterising the intractability of deciding membership in universal Horn classes generated by finite loop-free hypergraphs.     

A double arity hierarchy theorem for transitive closure logic

In this paper we prove that thek-ary fragment of transitive closure logic is not contained in the extension of the (k–1)-ary fragment of partial fixed point logic by all (2k–1)-ary generalized quantifiers. As a consequence, the arity hierarchies of all the familiar forms of fixed point logic are strict simultaneously with respect to the arity of the induction predicates and the arity of generalized quantifiers.Although it is known that our theorem cannot be extended to the sublogic deterministic transitive closure logic, we show that an extension is possible when we close this logic under congruence.Supported by a grant from the University of Helsinki. This research was initiated while he was a Junior Researcher at the Academy of FinlandThis article was processed by the author using the LATEX style filepljourlm from Springer-Verlag.     

Expressive completeness through logically tractable models

How can we prove that some fragment of a given logic has the power to define precisely all structural properties that satisfy some characteristic semantic preservation condition? This issue is a fundamental one for classical model theory and applications in non-classical settings alike. While methods differ greatly, and while the classical methods can usually not be matched for instance in the setting of finite model theory, this note surveys some interesting commonality revolving around the use and availability of tractable representatives in the relevant model classes. The construction of models in which simple invariants like partial types based on some weak fragment control all the relevant structural properties, may be seen at the heart of such questions. We highlight some constructions involving degrees of acyclicity and saturation that can be achieved in finite model constructions, and discuss their uses towards expressive completeness w.r.t. bisimulation based equivalences in hypergraphs and relational structures. The emphasis is on the combinatorial challenges in such more constructive approaches that work in non-classical settings and especially in finite model theory. One new result concerns expressive completeness w.r.t. guarded negation bisimulation, a back-and-forth equivalence involving local homomorphisms.     

Fuzzy Horn logic I

The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability of formulas from theories. Our basic structure of truth degrees is a complete residuated lattice. We derive a Pavelka-style completeness theorem (degree of provability equals degree of truth) from which we get some particular cases by imposing restrictions on the formulas under consideration. As a particular case, we obtain completeness of fuzzy equational logic.     

Modal characterisation theorems over special classes of frames

We investigate model theoretic characterisations of the expressive power of modal logics in terms of bisimulation invariance. The paradigmatic result of this kind is van Benthem’s theorem, which says that a first-order formula is invariant under bisimulation if, and only if, it is equivalent to a formula of basic modal logic. The present investigation primarily concerns ramifications for specific classes of structures. We study in particular model classes defined through conditions on the underlying frames, with a focus on frame classes that play a major role in modal correspondence theory and often correspond to typical application domains of modal logics. Classical model theoretic arguments do not apply to many of the most interesting classes-for instance, rooted frames, finite rooted frames, finite transitive frames, well-founded transitive frames, finite equivalence frames-as these are not elementary. Instead we develop and extend the game-based analysis (first-order Ehrenfeucht-Fraïssé versus bisimulation games) over such classes and provide bisimulation preserving model constructions within these classes. Over most of the classes considered, we obtain finite model theory analogues of the classically expected characterisations, with new proofs also for the classical setting. The class of transitive frames is a notable exception, with a marked difference between the classical and the finite model theory of bisimulation invariant first-order properties. Over the class of all finite transitive frames in particular, we find that monadic second-order logic is no more expressive than first-order as far as bisimulation invariant properties are concerned — though both are more expressive here than basic modal logic. We obtain ramifications of the de Jongh-Sambin theorem and a new and specific analogue of the Janin-Walukiewicz characterisation of bisimulation invariant monadic second-order for finite transitive frames.     

Remarks, du côté de chez Tarski, on symmetric ternary relations

We point out that the results in [12] are the model-theoretic counterpart of results established syntactically in [3] and [10], and that Martin’s theorem for the Euclidean 3- or higher-dimensional case, established in [5], does not depend on the Beckman-Quarles theorem, and can be rephrased as a result about axiomatizability and definability.     

On quasi‐varieties of multiple valued logic models

We extend the concept of quasi‐variety of first‐order models from classical logic to multiple valued logic (MVL) and study the relationship between quasi‐varieties and existence of initial models in MVL. We define a concept of ‘Horn sentence’ in MVL and based upon our study of quasi‐varieties of MVL models we derive the existence of initial models for MVL ‘Horn theories’. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Intrinsically Hyperarithmetical Sets

The main result proved in the paper is that on every recursive structure the intrinsically hyperarithmetical sets coincide with the relatively intrinsically hyperarithmetical sets. As a side effect of the proof an effective version of the Kueker's theorem on definability by means of infinitary formulas is obtained. Mathematics Subject Classification: 03D70, 03D75.     

The eskolemization of universal quantifiers

This paper is a sequel to the papers Baaz and Iemhoff (2006, 2009) [4] and [6] in which an alternative skolemization method called eskolemization was introduced that, when restricted to strong existential quantifiers, is sound and complete for constructive theories. In this paper we extend the method to universal quantifiers and show that for theories satisfying the witness property it is sound and complete for all formulas. We obtain a Herbrand theorem from this, and apply the method to the intuitionistic theory of equality and the intuitionistic theory of monadic predicates.     

Possible world semantics for first-order logic of proofs

In the tech report Artemov and Yavorskaya (Sidon) (2011) [4] an elegant formulation of the first-order logic of proofs was given, FOLP. This logic plays a fundamental role in providing an arithmetic semantics for first-order intuitionistic logic, as was shown. In particular, the tech report proved an arithmetic completeness theorem, and a realization theorem for FOLP. In this paper we provide a possible-world semantics for FOLP, based on the propositional semantics of Fitting (2005) [5]. We also give an Mkrtychev semantics. Motivation and intuition for FOLP can be found in Artemov and Yavorskaya (Sidon) (2011) [4], and are not fully discussed here.     

Reduced products and sheaves of metric structures

We introduce reduced products in continuous logic, and provide ways to establish satisfaction in the reduced product based on the satisfaction in its fibers, and conversely, on the lines that Horn and Chang did for reduced products in classical logic. We also consider a definition of a sheaf of metric structures, endow its stalks with a metric prestructure, and determine what filters can be used so that a collection of reduced products of arbitrary structures forms a sheaf on a given index space.     

Existential definability of modal frame classes

We prove an existential analogue of the Goldblatt-Thomason Theorem which characterizes modal definability of elementary classes of Kripke frames using closure under model theoretic constructions. The less known version of the Goldblatt-Thomason Theorem gives general conditions, without the assumption of first-order definability, but uses non-standard constructions and algebraic semantics. We present a non-algebraic proof of this result and we prove an analogous characterization for an alternative notion of modal definability, in which a class is defined by formulas which are satisfiable under any valuation (the so-called existential validity). Continuing previous work in which model theoretic characterization for this type of definability of elementary classes was proved, we give an analogous general result without the assumption of the first-order definability. Furthermore, we outline relationships between sets of existentially valid formulas corresponding to several well-known modal logics.     

On lovely pairs of geometric structures

We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We use the pairs to isolate a class of geometric structures called weakly locally modular which generalizes the class of linear structures in the settings of SU-rank one theories and o-minimal theories. For o-minimal theories, we use the Peterzil-Starchenko trichotomy theorem to characterize for a sufficiently general point, the local geometry around it in terms of the thorn U-rank of its type inside a lovely pair.     

Logics that define their own semantics

The capability of logical systems to express their own satisfaction relation is a key issue in mathematical logic. Our notion of self definability is based on encodings of pairs of the type (structure, formula) into single structures wherein the two components can be clearly distinguished. Hence, the ambiguity between structures and formulas, forming the basis for many classical results, is avoided. We restrict ourselves to countable, regular, logics over finite vocabularies. Our main theorem states that self definability, in this framework, is equivalent to the existence of complete problems under quantifier free reductions. Whereas this holds true for arbitrary structures, we focus on examples from Finite Model Theory. Here, the theorem sheds a new light on nesting hierarchies for certain generalized quantifiers. They can be interpreted as failure of self definability in the according extensions of first order logic. As a further application we study the possibility of the existence of recursive logics for PTIME. We restate a result of Dawar concluding from recursive logics to complete problems. We show that for the model checking Turing machines associated with a recursive logic, it makes no difference whether or not they may use built in clocks. Received: 7 February 1997     

Oligomorphic clones

A permutation group on a countably infinite domain is called oligomorphic if it has finitely many orbits of finitary tuples. We define a clone on a countable domain to be oligomorphic if its set of permutations forms an oligomorphic permutation group. There is a close relationship to ω-categorical structures, i.e., countably infinite structures with a first-order theory that has only one countable model, up to isomorphism. Every locally closed oligomorphic permutation group is the automorphism group of an ω-categorical structure, and conversely, the canonical structure of an oligomorphic permutation group is an ω-categorical structure that contains all first-order definable relations. There is a similar Galois connection between locally closed oligomorphic clones and ω-categorical structures containing all primitive positive definable relations. In this article we generalise some fundamental theorems of universal algebra from clones over a finite domain to oligomorphic clones. First, we define minimal oligomorphic clones, and present equivalent characterisations of minimality, and then generalise Rosenberg’s five types classification to minimal oligomorphic clones. We also present a generalisation of the theorem of Baker and Pixley to oligomorphic clones. Presented by A. Szendrei. Received July 12, 2005; accepted in final form August 29, 2006.