Decidability of the Logics of the Reflexive Sub-interval and Super-interval Relations over Finite Linear Orders

For classes ${\cal O}$ of structures on finite linear orders (permutations, ordered graphs etc.) endowed with containment order $\preceq$ (containment of permutations, subgraph relation etc.), we investigate restrictions on the function $f(n)$ counting objects with size $n$ in a lower ideal in $({\cal O},\preceq)$. We present a framework of edge $P$-colored complete graphs $({\cal C}(P),\preceq)$ which includes many of these situations, and we prove for it two such restrictions (jumps in growth): $f(n)$ is eventually constant or $f(n)\ge n$ for all $n\ge 1$; $f(n)\le n^c$ for all $n\ge 1$ for a constant $c>0$ or $f(n)\ge F_n$ for all $n\ge 1$, $F_n$ being the Fibonacci numbers. This generalizes a fragment of a more detailed theorem of Balogh, Bollobás and Morris on hereditary properties of ordered graphs.

A Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: An Implementation

Lecture Notes in Computer Science - Automated Reasoning with Analytic Tableaux and Related Methods ◽

10.1007/978-3-642-40537-2_8 ◽

2013 ◽

pp. 74-80 ◽

Cited By ~ 2

Author(s):

Davide Bresolin ◽

Dario Della Monica ◽

Angelo Montanari ◽

Guido Sciavicco

Keyword(s):

Linear Orders ◽

Tableau System ◽

Finite Linear

Examples of theories of presheaf type

10.1093/oso/9780198758914.003.0011 ◽

2018 ◽

Author(s):

Olivia Caramello

Keyword(s):

Finite Groups ◽

Linear Independence ◽

Geometric Theory ◽

Vector Spaces ◽

Linear Orders ◽

Locally Finite ◽

Strong Unit ◽

Locally Finite Groups ◽

Simplicial Sets ◽

Separable Extensions

This chapter discusses several classical as well as new examples of theories of presheaf type from the perspective of the theory developed in the previous chapters. The known examples of theories of presheaf type that are revisited in the course of the chapter include the theory of intervals (classified by the topos of simplicial sets), the theory of linear orders, the theory of Diers fields, the theory of abstract circles (classified by the topos of cyclic sets) and the geometric theory of finite sets. The new examples include the theory of algebraic (or separable) extensions of a given field, the theory of locally finite groups, the theory of vector spaces with linear independence predicates and the theory of lattice-ordered abelian groups with strong unit.

FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS

Journal of Symbolic Logic ◽

10.1017/jsl.2021.15 ◽

2021 ◽

pp. 1-39

Author(s):

JUN LE GOH ◽

ARNO PAULY ◽

MANLIO VALENTI

Keyword(s):

Linear Orders

A model with Suslin trees but no minimal uncountable linear orders other than ω1 and −ω1

Israel Journal of Mathematics ◽

10.1007/s11856-019-1899-x ◽

2019 ◽

Vol 233 (1) ◽

pp. 199-224

Author(s):

Dániel T. Soukup

Keyword(s):

Linear Orders

Shuffling of Linear Orders

Canadian Mathematical Bulletin ◽

10.4153/cmb-1995-032-1 ◽

1995 ◽

Vol 38 (2) ◽

pp. 223-229

Author(s):

John Lindsay Orr

Keyword(s):

Ordered Set ◽

Linear Orders ◽

Real Numbers ◽

The Real ◽

Linearly Ordered Set

AbstractA linearly ordered set A is said to shuffle into another linearly ordered set B if there is an order preserving surjection A —> B such that the preimage of each member of a cofinite subset of B has an arbitrary pre-defined finite cardinality. We show that every countable linearly ordered set shuffles into itself. This leads to consequences on transformations of subsets of the real numbers by order preserving maps.

Eigenvalues of the homogeneous finite linear one step master equation: Applications to downhill folding

The Journal of Chemical Physics ◽

10.1063/1.4769295 ◽

2012 ◽

Vol 137 (21) ◽

pp. 215106 ◽

Cited By ~ 2

Author(s):

Thomas J. Lane ◽

Vijay S. Pande

Keyword(s):

Master Equation ◽

Downhill Folding ◽

One Step ◽

Finite Linear

Two results on borel orders

Journal of Symbolic Logic ◽

10.2307/2274748 ◽

1989 ◽

Vol 54 (3) ◽

pp. 865-874 ◽

Cited By ~ 5

Author(s):

Alain Louveau

Keyword(s):

Linear Order ◽

Linear Orders ◽

Lexicographic Ordering ◽

Countable Ordinal

AbstractWe prove two results about the embeddability relation between Borel linear orders: For η a countable ordinal, let 2η (resp. 2< η) be the set of sequences of zeros and ones of length η (resp. < η), equipped with the lexicographic ordering. Given a Borel linear order X and a countable ordinal ξ, we prove the following two facts.(a) Either X can be embedded (in a (X, ξ) way) in 2ωξ or 2ωξ + 1 continuously embeds in X.(b) Either X can embedded (in a (X, ξ) way) in 2<ωξ or 2ωξ continuously embeds in X. These results extend previous work of Harrington, Shelah and Marker.

UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES

Journal of Symbolic Logic ◽

10.1017/jsl.2014.54 ◽

2014 ◽

Vol 79 (4) ◽

pp. 1001-1019 ◽

Cited By ~ 2

Author(s):

ASHER M. KACH ◽

ANTONIO MONTALBÁN

Keyword(s):

Direct Product ◽

Disjoint Union ◽

Second Order ◽

Linear Orders ◽

Second Order Arithmetic ◽

Order Arithmetic ◽

Natural Classes ◽

Product Of Groups

AbstractMany classes of structures have natural functions and relations on them: concatenation of linear orders, direct product of groups, disjoint union of equivalence structures, and so on. Here, we study the (un)decidability of the theory of several natural classes of structures with appropriate functions and relations. For some of these classes of structures, the resulting theory is decidable; for some of these classes of structures, the resulting theory is bi-interpretable with second-order arithmetic.

On the Ungrammaticality of Remnant Movement in the Derivation of Greenberg's Universal 20

Linguistic Inquiry ◽

10.1162/ling_a_00053 ◽

2011 ◽

Vol 42 (3) ◽

pp. 445-469 ◽

Cited By ~ 12

Author(s):

Sam Steddy ◽

Vieri Samek-Lodovici

Keyword(s):

Optimality Theory ◽

Linear Orders ◽

Original Analysis ◽

Remnant Movement

We propose an analysis that derives Cinque's (2005) typology of linear orders involving a demonstrative, numeral, adjective, and noun through four Optimality Theory constraints requiring leftward alignment of these items. We show that remnant movement is ungrammatical whenever it produces universally suboptimal alignments, compared with remnant-movement-free structures. Any movement is permitted, but only the best alignment configurations surface as grammatical. We also show that Cinque's original analysis must encode the structural derivations of all attested orders as parametric values of the associated languages. Our analysis need not make similar structural stipulations, as the different attested structures emerge from constraint reranking.