DOCSLIB.ORG

Modal Logics of Ordered Trees

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Modal Logics of Ordered Trees Modal Logics of Ordered Trees Ulrich Endriss Modal Logics of Ordered Trees Ulrich Endriss 2003 A thesis submitted to the University of London for the degree of Doctor of Philosophy King’s College London Department of Computer Science Revised Edition (March 2003) Abstract This thesis makes a contribution to the area of modal and temporal logics, an impor- tant family of non-classical logics that have found numerous applications in computer science and several other disciplines. Temporal logics, in particular, have been applied very successfully in the area of systems specification and verification. However, these logics often do not support the notion of refinement in a natural manner. There is no simple way to extend a given system specification, expressed in a standard temporal logic such as, for instance, propositional linear temporal logic, by the specification of a new subsystem. It is therefore important to extend available formalisms in ways that allow for the representation of complex systems evolving over time in a modular fashion. To this end, we propose to equip propositional linear temporal logics with a ‘zoom feature’ in the following manner. If we extend the class of modal frames of this logic by adding a vertical accessibility relation to connect every time point with a new time line, we obtain a tree-like structure where the children of each node form a linear order. More precisely, we obtain a modal logic with frames that are ordered trees. The horizontal accessibility relation is still given a temporal interpretation, while the vertical allows us to move between different levels of abstraction, that is, between a system and its subsystems. Our logic provides modal operators working both along the branches of a tree and along the order declared over the children of a node. The body of this work is devoted to the theoretical study of this modal logic of ordered trees. In particular, we are concerned with an axiomatic characterisation of our logic complementing its semantics-driven definition and with proving its decidability. Acknowledgements Many people have, in one way or another, played their part in the genesis of this thesis. Individual contributions range from very concrete support with my scientific endeavours to just being nice and making my years as a PhD student a very enjoyable time. In what follows, I shall mostly concentrate on the former type of contribution, but hope everyone else will get the message as well. First and foremost, I should like to thank Dov Gabbay, my thesis supervisor, for his encouragement and support throughout my studies, for being a great inspiration from Day One, for letting me do things my way, and for always sharing his insights on logic and people. The Group of Logic and Computation at King’s College (now the Group of Logic, Language and Computation) has provided the perfect environment for my studies. Everyone in the group, our numerous visitors, and many others in the Department of Computer Science have contributed to a very pleasant and stimulating working atmosphere. This includes, in particular, my first generation of office mates in 542: Stefan Schlobach, Odinaldo Rodrigues, and Wilfried Meyer-Viol. I’m also indebted to Hans J¨urgen Ohlbach for his help and support whilst being my second thesis supervisor at the beginning of my PhD studies, before he moved on to Munich. Stefan Schlobach, Wilfried Meyer-Viol, and Raquel Fern´andezhave read large parts of various earlier incarnations of this thesis and their feedback has substantially im- proved the final product. Thanks are also due to Misha Zakharyaschev, Agi Kurucz, and Valentin Shehtman for answering a plethora of questions on modal logic; and to the regulars at our logic reading group: David Gabelaia, Roman Kontchakov, Corinna Elsen- broich, and George Metcalfe. I have also greatly benefited from discussing my work with the many people I met along the way, in particular Martina Kullmann, Carsten Lutz, Enrico Franconi, Alessandro Artale, Anuj Dawar, and Ian Hodkinson. Naza Aguirre deserves a special mention for showing me that the software engineering people still need a lot more temporal logic. Finally, I would like to thank Howard Barringer and Robin Hirsch for having agreed to examine this work. On a more personal note, this seems like a good place to acknowledge the part my parents, Micha and Moni Endriß, have had in all of this. London, January 2003 U.E. The research reported here has been generously funded by the UK Engineering and Phys- ical Sciences Research Council (EPSRC) through a number of projects: GR/L91818/01 (grant holders: D. Gabbay and H. J. Ohlbach), GR/R45369/01 (M. Zakharyaschev, D. Gabbay, and I. Hodkinson), and GR/N23028/01 (D. Gabbay), all at King’s College London. The writing-up of the thesis was completed while the author was employed at Imperial College London on a research project funded by the European Union under grant reference number IST-2001-32530 (grant holders at Imperial: F. Toni and F. Sadri). Contents 1 Zooming in 1 1.1 Adding a Zoom to Linear Temporal Logic . 1 1.2 Thesis Overview . 10 2 Modal and Temporal Logics 13 2.1 Introducing Modalities . 13 2.2 Possible World Semantics . 18 2.3 Axioms and Correspondences . 24 2.4 Temporal Logic . 31 2.5 Bibliographic Notes . 37 3 Semantic Characterisation 39 3.1 Syntax and Semantics . 39 3.2 Some Defined Operators . 48 3.3 Correspondences . 50 3.4 Ontological Considerations . 55 3.5 General Models and P-morphisms . 60 3.6 Loosely Ordered Trees . 67 3.7 Summary . 94 4 Axiomatic Characterisation 97 4.1 Axioms and Rules . 97 4.2 Some Derived Theorems . 108 4.3 Completeness without Descendant Modalities . 113 4.4 Alternatives . 141 4.5 Summary . 145 5 Decidability 147 5.1 Monadic Second-order Logic . 147 5.2 Finite Binary Trees . 159 5.3 Discretely Ordered Trees . 163 5.4 General Ordered Trees . 169 5.5 Summary . 182 vii viii Contents 6 Zooming out 185 6.1 Extensions . 185 6.2 Summary of Main Results . 192 6.3 Open Problems . 193 Appendices 197 A Relations and Orders 199 A.1 Relations . 199 A.2 Linear Orders . 200 B Derivations 203 B.1 Proof of Lemma 4.8 .............................. 203 Bibliography 205 List of Figures 211 List of Tables 213 Index 215 Chapter 1 Zooming in In this thesis we develop a new modal logic to represent complex systems evolving over time in a modular fashion. As will be explained in this chapter, this new logic may be regarded as the result of extending well-known linear temporal logic by a second dimension that allows us to zoom into states and thereby model events associated with them in more detail. In this sense, our logic may be described as an extended temporal logic. From a more abstract point of view, our logic is best characterised as a modal logic of ordered trees. In this first chapter we motivate the enterprise of developing such a logic in the first place and give an informal outline of some of the main results reported in the sequel. The final section also provides a compact overview of the thesis as a whole, organised by chapters. 1.1 Adding a Zoom to Linear Temporal Logic Why? What do we mean by adding a zoom to temporal logic and why would anyone want to do something like this? We begin our explanation with a story, the story of Mary. Mary was an aspiring young software engineer who was working for an up-and-coming information technology company offering state-of-the-art software solutions to its clients and profitable revenue to its shareholders. One day, not that long ago, the company’s young and dynamic marketing department managed to secure a major contract with a new heavy-weight client. It was their biggest software development contract yet and a lot (if not everything) depended on its successful completion. Mary was appointed Chief Engineer on the project. Most people would have been intimidated by that much responsibility. Not Mary though. She was not only a true professional, but had also benefited from an excellent educational system which had provided her with a very respectable academic background. Mary had completed a degree in Computer Science at one of the country’s finest univer- sities. She was fluent in all the major programming languages, knew her computer inside out, and commanded an intimate knowledge of all phases of the software development 1 2 Chapter 1. Zooming in process, be it design, implementation, or evaluation of the final product. She was even good at maths. But was all of this going to be enough for this new and highly critical project? The central question seemed to be: How do you make sure the system will really do what it is supposed to? Mary was lucky. In her final year at university, besides all the programming lan- guages, software engineering, databases, and computer architecture, she had also at- tended a class on non-classical logics, which was at the time taught by a very famous logic professor. In fact, she probably did not even realise just how lucky she had been, because most of the time the famous professor was tied up in research, which regularly involved writing books, proving ground-breaking new results, and even developing whole new schools of thought. But this particular year he did teach and Mary enjoyed the course very much. One of the subjects that made a lasting impression on her was the field of temporal logics. She could remember it very well. Temporal logics were aston- ishingly simple, yet extremely powerful; full of mathematical depth and beauty, but also — as she had realised by now — of immediate industrial relevance.
Load more

Recommended publications
  • Order Types and Structure of Orders
    ORDER TYPES AND STRUCTURE OF ORDERS BY ANDRE GLEYZALp) 1. Introduction. This paper is concerned with operations on order types or order properties a and the construction of order types related to a. The reference throughout is to simply or linearly ordered sets, and we shall speak of a as either property or type. Let a and ß be any two order types. An order A will be said to be of type aß if it is the sum of /3-orders (orders of type ß) over an a-order; i.e., if A permits of decomposition into nonoverlapping seg- ments each of order type ß, the segments themselves forming an order of type a. We have thus associated with every pair of order types a and ß the product order type aß. The definition of product for order types automatically associates with every order type a the order types aa = a2, aa2 = a3, ■ ■ ■ . We may further- more define, for all ordinals X, a Xth power of a, a\ and finally a limit order type a1. This order type has certain interesting properties. It has closure with respect to the product operation, for the sum of ar-orders over an a7-order is an a'-order, i.e., a'al = aI. For this reason we call a1 iterative. In general, we term an order type ß having the property that ßß = ß iterative, a1 has the following postulational identification: 1. a7 is a supertype of a; that is to say, all a-orders are a7-orders. 2. a1 is iterative.
    [Show full text]
  • Multiplication in Vector Lattices
    MULTIPLICATION IN VECTOR LATTICES NORMAN M. RICE 1. Introduction. B. Z. Vulih has shown (13) how an essentially unique intrinsic multiplication can be defined in a Dedekind complete vector lattice L having a weak order unit. Since this work is available only in Russian, a brief outline is given in § 2 (cf. also the review by E. Hewitt (4), and for details, consult (13) or (11)). In general, not every pair of elements in L will have a product in L. In § 3 we discuss certain properties which ensure that, in fact, the multiplication will be universally defined, and it turns out that L can always be embedded as an order-dense order ideal in a larger space L# which has these properties. It is then possible to define multiplication in spaces without a unit. In § 4 we show that if L has a normal integral 0, then 4> can be extended to a normal integral on a larger space Li(<t>) in L#, and £i(0) may be regarded as an abstract integral space. In § 5 a very general form of the Radon-Niko- dym theorem is proved, and in § 6 this is used to give a relatively simple proof of a theorem of Segal giving a necessary and sufficient condition for the Radon-Nikodym theorem to hold in a measure space. 2. Multiplication in spaces with a unit. Let L be a vector lattice which is Dedekind complete (i.e., every set which is bounded above has a least upper bound) and has a weak order unit 1 (i.e., inf (1, x) > 0, whenever x > 0).
    [Show full text]
  • When Is a Lots Densely Orderable?
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Topology and its Applications 30 (1988) 225-235 225 North-Holland WHEN IS A LOTS DENSELY ORDERABLE? Victor NEUMANN-LARA Institute de Matetmiticas, Uniuersidad National Autdnoma de M&ico, Ciudad Universitaria, Mhico 20, D.F. Richard C. WILSON Departamento de Matemdticas, Universidad Autdnoma Metropolitana, Unidad Iztapalapa, M&ico 13, D.F. Received 15 May 1986 Revised 19 October 1987 We obtain sufficient conditions for a linearly ordered topological space (LOTS) to be densely orderable. As a consequence we obtain a characterization of those metrizable LOTS with connected ordered compactifications. AMS (MOS) Subj. Class.: Primary 54F05 1. Introduction A well-known result states that the weight w of a linearly ordered topological space (LOTS) is equal to the sum of the density d and the number of jumps j. Thus if j > d, then w =j and hence j is an order-topological invariant of the space in the sense that any other order which induces the same topology will have the same number of jumps. On the other hand, if j G d (in particular if j = Ko) then this is not necessarily the case-for example, the space of rationals Q with the order topology is homeomophic to Q x (0, l} with the lexicographic order topology. In this paper we will obtain conditions under which a LOTS can be reordered without jumps, that is to say under which there exists a dense order inducing the same topology. 2.
    [Show full text]
  • General-Well-Ordered Sets
    J. Austral. Math. Soc. 19 (Series A), (1975), 7-20. GENERAL-WELL-ORDERED SETS J. L. HICKMAN (Received 10 April 1972) Communicated by J. N. Crossley It is of course well known that within the framework of any reasonable set theory whose axioms include that of choice, we can characterize well-orderings in two different ways: (1) a total order for which every nonempty subset has a minimal element; (2) a total order in which there are no infinite descending chains. Now the theory of well-ordered sets and their ordinals that is expounded in various texts takes as its definition characterization (1) above; in this paper we commence an investigation into the corresponding theory that takes character- ization (2) as its starting point. Naturally if we are to obtain any differences at all, we must exclude the axiom of choice from our set theory. Thus we state right at the outset that we are working in Zermelo-Fraenkel set theory without choice. This is not enough, however, for it may turn out that the axiom of choice is not really necessary for the equivalence of (1) and (2), and if this were so, we would still not obtain any deviation from the "classical" theory. Thus the first section of this paper will be devoted to showing that we can in fact have sets that are well-ordered according to (2) but not according to (1). Naturally we have no hope of reversing this situation, for it is a ZF-theorem that any set well-ordered by (1) is also well-ordered by (2).
    [Show full text]
  • Logic and Rational Languages of Words Indexed by Linear Orderings
    Logic and Rational Languages of Words Indexed by Linear Orderings Nicolas Bedon1, Alexis B`es2, Olivier Carton3, and Chlo´eRispal1 1 Universit´eParis-Est and CNRS Laboratoire d’informatique de l’Institut Gaspard Monge, CNRS UMR 8049 Email: [email protected], [email protected] 2 Universit´eParis-Est, LACL Email: [email protected], 3 Universit´eParis 7 and CNRS LIAFA, CNRS UMR 7089 Email: [email protected] Abstract. We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of languages indexed by countable scattered linear orderings, but false in the general case. As a corollary we prove that the inclusion problem for rational languages of words indexed by countable linear orderings is decidable. 1 Introduction In [4, 6], Bruy`ere and Carton introduce automata and rational expressions for words on linear orderings. These notions unify naturally previously defined no- tions for finite words, left- and right-infinite words, bi-infinite words, and ordinal words. They also prove that a Kleene-like theorem holds when the orderings are restricted to countable scattered linear orderings; recall that a linear ordering is scattered if it does not contain any dense sub-ordering. Since [4], the study of automata on linear orderings was carried on in several papers. The emptiness problem and the inclusion problem for rational languages is addressed in [7, 11]. The papers [5, 2] provide a classification of rational languages with respect to the rational operations needed to describe them.
    [Show full text]
  • Discretely Ordered Groups Peter a Linnell, Akbar Rhemtulla and Dale P
    Algebra & Number Theory Volume 3 2009 No. 7 Discretely ordered groups Peter A Linnell, Akbar Rhemtulla and Dale P. O. Rolfsen mathematical sciences publishers ALGEBRA AND NUMBER THEORY 3:7(2009) Discretely ordered groups Peter A Linnell, Akbar Rhemtulla and Dale P. O. Rolfsen We consider group orders and right-orders which are discrete, meaning there is a least element which is greater than the identity. We note that nonabelian free groups cannot be given discrete orders, although they do have right-orders which are discrete. More generally, we give necessary and sufficient conditions that a given orderable group can be endowed with a discrete order. In particular, every orderable group G embeds in a discretely orderable group. We also consider conditions on right-orderable groups to be discretely right-orderable. Finally, we discuss a number of illustrative examples involving discrete orderability, includ- ing the Artin braid groups and Bergman’s nonlocally-indicable right orderable groups. 1. Introduction Let G be a group and suppose < is a strict total order relation on the set of its elements. Then .G; </ is a right-ordered group if f < g implies that f h < gh for all f; g; h 2 G. If in addition f < g implies that h f < hg, then we say .G; </ is an ordered group. If such an order exists for a given group G, we say that G is right-orderable or orderable, respectively. We call the order < discrete if there is an element a 2 G such that 1 < a, where 1 denotes the identity element of G, and there is no element of G strictly between these.
    [Show full text]
  • Which Countable Ordered Sets Have a Dense Linear Extension?
    Mathematica Slovaca Aleksander Rutkowski Which countable ordered sets have a dense linear extension? Mathematica Slovaca, Vol. 46 (1996), No. 5, 445--455 Persistent URL: http://dml.cz/dmlcz/136684 Terms of use: © Mathematical Institute of the Slovak Academy of Sciences, 1996 Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library http://project.dml.cz řvlathernatica Slovaca ©1996 .. _. ... /~nn/~\ .• ,- . .,- ..-.- Mathematical Institute Math. Sl0VaC3, 46 (1996), NO. 5, 445-455 Slovák Academy of Sciences Dedicated to the memory of Professor Milan Kolibiar WHICH COUNTABLE ORDERED SETS HAVE A DENSE LINEAR EXTENSION? ALEKSANDER RUTKOWSKI (Communicated by Tibor Katrindk ) ABSTRACT. We try to answer the question: when a partial order can be ex­ tended to an order isomorphic to the ordering of rationals? One necessary and a few sufficient conditions for the existence of such an extension are presented. 1. Introduction This article is located on the crossing of paths leading from the two fundamen­ tal results on ordered sets, namely: Marczewski Theorem and Cantor Theorem. MARCZEWSKI THEOREM. ([13]) Every partial order can be extended to a linear order (with the same underlying set). Moreover, it is the intersection of such extensions. CANTOR THEOREM. ([5]) Every countable linearly and densely ordered set containing neither the least nor the greatest element is order-isomorphic to the set Q of all rationals (with natural order).
    [Show full text]
  • The Structure of Orders in the Pushdown Hierarchy Laurent Braud
    The structure of orders in the pushdown hierarchy Laurent Braud To cite this version: Laurent Braud. The structure of orders in the pushdown hierarchy. Modeling and Simulation. Uni- versité Paris-Est, 2010. English. NNT : 2010PEST1009. tel-00587409 HAL Id: tel-00587409 https://pastel.archives-ouvertes.fr/tel-00587409 Submitted on 20 Apr 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THESE` pour obtenir le grade de DOCTEUR DE L’UNIVERSITE´ PARIS-EST The structure of orders in the pushdown hierarchy Les structures d’ordre dans la hi´erarchie `apile Sp´ecialit´e informatique Ecole´ doctorale MSTIC Soutenue publiquement par Laurent Braud le 10 d´ecembre 2010 JURY : Zolt´an Esik´ , rapporteur, Wolfgang Thomas, rapporteur, Arnaud Carayol, examinateur, Damian Niwinski´ , examinateur, Dominique Perrin, examinateur, Didier Caucal, directeur de th`ese. 2 Contents 1 Introduction 7 1.1 (enfran¸cais)................................... 7 1.2 (inEnglish) ................................... 13 2 Preliminaries 19 2.1 Notationsandfirststructures . .. 19 2.1.1 Finitewords............................... 19 2.1.2 Structures ................................ 20 2.1.3 Graphs.................................. 21 2.1.4 Deterministictrees ........................... 22 2.2 Linearorderings................................. 22 2.2.1 Ordinals................................. 24 2.2.2 ScatteredorderingsandHausdorffrank . .. 26 2.2.3 Ordersinadeterministictree .
    [Show full text]
  • The Embedding Structure for Linearly Ordered Topological Spaces ∗ A
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Topology and its Applications 159 (2012) 3103–3114 Contents lists available at SciVerse ScienceDirect Topology and its Applications www.elsevier.com/locate/topol The embedding structure for linearly ordered topological spaces ∗ A. Primavesi a,1, K. Thompson b, ,2 a School of Mathematics, University of East Anglia, Norwich, NR4 7TJ, UK b Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Wiedner Hauptstraße 8-10/104, A-1040 Wien, Austria article info abstract MSC: In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by primary 54F05 the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this secondary 06F30, 03E75 quasi-order has both a maximal (universal) element and a finite basis. For the class of ℵ uncountable LOTS of cardinality κ where κ 2 0 , it is proved that this quasi-order has no Keywords: maximal element and that in fact the dominating number for such quasi-orders is maximal, Linearly ordered topological space i.e. 2κ . Certain subclasses of LOTS, such as the separable LOTS, are studied with respect to LOTS Universal structure the top and internal structure of their respective embedding quasi-order. The basis problem Basis for uncountable LOTS is also considered; assuming the Proper Forcing Axiom there is an Well-quasi-order eleven element basis for the class of uncountable LOTS and a six element basis for the class of dense uncountable LOTS in which all points have countable cofinality and coinitiality.
    [Show full text]
  • Ordered Products of Topological Groups Melvin Henriksen Harvey Mudd College
    Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 9-1-1987 Ordered Products of Topological Groups Melvin Henriksen Harvey Mudd College Ralph Kopperman City College of New York Frank A. Smith Kent State University Recommended Citation Henriksen, M., R. Kopperman, and F. A. Smith. "Ordered products of topological groups." Mathematical Proceedings of the Cambridge Philosophical Society 102.2 (September 1987): 281-295. DOI: 10.1017/S030500410006730X This Article is brought to you for free and open access by the HMC Faculty Scholarship at Scholarship @ Claremont. It has been accepted for inclusion in All HMC Faculty Publications and Research by an authorized administrator of Scholarship @ Claremont. For more information, please contact [email protected]. Math. Proc. Camb. Phil. Soc. (1987), 102, 281 281 Printed in Great Britain Ordered products of topological groups BY M. HENRIKSEN Harvey Mudd College, Claremont, CA 91711, U.S.A. R. KOPPERMAN City College of New York, New York, NY 10031, U.S.A. AND F. A. SMITH Kent State University, Kent, OH 44242, U.S.A. (Received 25 June 1986; revised 5 January 1987) 1. Introduction The topology most often used on a totally ordered group (G, <) is the interval topology. There are usually many ways to totally order GxG (e.g., the lexicographic order) but the interval topology induced by such a total order is rarely used since the product topology has obvious advantages. Let R( +) denote the real line with its usual order and Q( + ) the subgroup of rational numbers. There is an order on Q x Q whose associated interval topology is the product topology, but no such order on IR x IR can be found.
    [Show full text]
  • Automorphism Groups of Totally Ordered Sets: a Retrospective Survey
    Automorphism groups of totally ordered sets: a retrospective survey. V. V. Bludov, M. Droste and A. M. W. Glass July 23, 2009 To Charles on his 75th birthday with our gratitude for his research, help and friendship. Abstract In 1963, W. Charles Holland proved that every lattice-ordered group can be embedded in the lattice-ordered group of all order- preserving permutations of a totally ordered set. In this article we examine the context and proof of this result and survey some of the many consequences of the ideas involved in this important theorem. 1 Genesis In 1957, P. M. Cohn noted that Cayley's (right regular) Representation Theorem applies immediately to right-ordered groups [12]. That is, let G be a group with a total order that is preserved by multiplication on the right. Embed G in the group A(G) := Aut(G; ·) of all order-preserving permutations of the set (G; ·) via the right regular representation; i.e., |||||||||||||{ AMS Classi¯cation: 06F15, 20F60, 20B27, 20F10. Keywords: totally ordered set, permutation group, representation, primitive permutation group, amalgamation, free product with amal- gamated subgroup, right-orderable group, normal subgroups, Bergman property, outer automorphism groups. 1 f(g#) = fg (f; g 2 G). Now A(G) can be right totally ordered as follows: let Á be any well-ordering of the set G and de¯ne a < b i® ®0a < ®0b, where ®0 is the least element of G (under Á) of the support of ba¡1. If we choose Á so that its least element is the identity of G, then the right regular embedding preserves the group operation and the total order: g1 < g2 in G i® g1# < g2# in A(G).
    [Show full text]
  • The 116 Reducts of (Q, <
    The 116 reducts of (Q, <, a)∗ Markus Junker, Martin Ziegler Mathematisches Institut Abteilung fur¨ mathematische Logik Universit¨at Freiburg, Germany July 2006, revised December 2007 Abstract This article aims to classify those reducts of expansions of (Q, <) by unary predicates which eliminate quantifiers, and in particular to show that, up to interdefinability, there are only finitely many for a given language. Equivalently, we wish to classify the closed subgroups of Sym(Q) containing the group of all automorphisms of (Q, <) fixing setwise certain subsets. This goal is achieved for expansions by convex predicates, yielding expansions by constants as a special case, and for the expansion by a dense, co-dense predicate. Partial results are obtained in the general setting of several dense predicates. 1 Introduction In this article, we study expansions of (Q, <) by unary predicates that have quantifier elimi- nation. Our goal is to classify the reducts and to show that, up to interdefinability, there are only finitely many such. Here, a reduct for us is a structure with domain Q in some relational language each of whose basic relations are ∅-definable in the original structure. We will consider two interdefinable reducts as the same structure. E.g. Q with the circular ordering coming from < is a reduct of (Q, <), and considered to be the same reduct as Q with the reverse circular ordering. All structures under consideration here are ℵ0-categorical, and so we can identify a structure with its automorphism group, viewed as a permutation group on Q. A reduct then corresponds to a closed subgroup of the full symmetric group on Q containing the automorphism group of the original structure.
    [Show full text]