Weakly binary expansions of dense meet‐trees

Mathematical Logic Quarterly 68 (1):32-47 (2022)
  Copy   BIBTEX

Abstract

We compute the domination monoid in the theory of dense meet‐trees. In order to show that this monoid is well‐defined, we prove weak binarity of and, more generally, of certain expansions of it by binary relations on sets of open cones, a special case being the theory from [7]. We then describe the domination monoids of such expansions in terms of those of the expanding relations.

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.202000045

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

The 116 reducts of (ℚ, <,a).Markus Junker & Martin Ziegler - 2008 - Journal of Symbolic Logic 73 (3):861-884.
ω‐categorical weakly o‐minimal expansions of Boolean lattices.Stefano Leonesi & Carlo Toffalori - 2003 - Mathematical Logic Quarterly 49 (4):394-400.
The density of the meet-inaccessible r. e. degrees.Zhang Qinglong - 1992 - Journal of Symbolic Logic 57 (2):585-596.
Weakly o-minimal nonvaluational structures.Roman Wencel - 2008 - Annals of Pure and Applied Logic 154 (3):139-162.
Binary types in ℵ0‐categorical weakly o‐minimal theories.Beibut Sh Kulpeshov - 2011 - Mathematical Logic Quarterly 57 (3):246-255.
Weakly o-Minimal Expansions of Boolean Algebras.Carlo Toffalori & S. Leonesi - 2001 - Mathematical Logic Quarterly 47 (2):223-238.
Finding paths through narrow and wide trees.Stephen Binns & Bjørn Kjos-Hanssen - 2009 - Journal of Symbolic Logic 74 (1):349-360.
Weakly pointed trees and partial injections.John D. Clemens - 2008 - Journal of Symbolic Logic 73 (1):363-368.
A comparison of well-known ordinal notation systems for ε0.Gyesik Lee - 2007 - Annals of Pure and Applied Logic 147 (1):48-70.
A remark on functional completeness of binary expansions of Kleene’s strong 3-valued logic.Gemma Robles & José M. Méndez - 2022 - Logic Journal of the IGPL 30 (1):21-33.
Definable groups in dense pairs of geometric structures.Alexander Berenstein & Evgueni Vassiliev - 2022 - Archive for Mathematical Logic 61 (3):345-372.
Linguistics, Logic and Finite Trees.Patrick Blackburn & Wilfried Meyer-Viol - 1994 - Logic Journal of the IGPL 2 (1):3-29.
Weakly minimal groups with a new predicate.Gabriel Conant & Michael C. Laskowski - 2020 - Journal of Mathematical Logic 20 (2):2050011.
Expansions of Dense Linear Orders with the Intermediate Value Property.Chris Miller - 2001 - Journal of Symbolic Logic 66 (4):1783-1790.
Expansions of dense linear orders with the intermediate value property.Chris Miller - 2001 - Journal of Symbolic Logic 66 (4):1783-1790.

Analytics

Added to PP
2022-04-10

Downloads
10 (#1,160,791)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Semi-Equational Theories.Artem Chernikov & Alex Mennen - forthcoming - Journal of Symbolic Logic:1-32.

Add more citations

References found in this work

On dp-minimal ordered structures.Pierre Simon - 2011 - Journal of Symbolic Logic 76 (2):448 - 460.
On variants of o-minimality.Dugald Macpherson & Charles Steinhorn - 1996 - Annals of Pure and Applied Logic 79 (2):165-209.
Product of invariant types modulo domination–equivalence.Rosario Mennuni - 2020 - Archive for Mathematical Logic 59 (1):1-29.
Invariant types in NIP theories.Pierre Simon - 2015 - Journal of Mathematical Logic 15 (2):1550006.
Non-forking and preservation of NIP and dp-rank.Pedro Andrés Estevan & Itay Kaplan - 2021 - Annals of Pure and Applied Logic 172 (6):102946.

View all 7 references / Add more references