scientific article

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

model theory recursive function theory combinatorial aspects of linear orderings logical aspects of linear orderings

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Total orders (06A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)

Related Items (only showing first 100 items - show all)

Generalized pigeonhole properties of graphs and oriented graphs ⋮ Modulo-counting quantifiers over finite trees ⋮ A partition relation for partially ordered sets ⋮ Tree-automatic scattered linear orders ⋮ A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases ⋮ A note on \(\aleph_\alpha\)-saturated o-minimal expansions of real closed fields ⋮ Universality of the automorphism group of the real line ⋮ A formal study of linearity axioms for fuzzy orderings ⋮ Complete embeddings of linear orderings and embeddings of lattice-ordered groups ⋮ The Debreu Gap Lemma and some generalizations ⋮ Cardinals of countable cofinality and eventual domination ⋮ First-order logic and its infinitary quantifier extensions over countable words ⋮ Two equational theories of partial words ⋮ The complexity of the fixed point property ⋮ The metamathematics of scattered linear orderings ⋮ Irrational ordered groups ⋮ Characterizing rational versus exponential learning curves ⋮ Cancellation and absorption of lexicographic powers of totally ordered Abelian groups ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ Semisimple rings and von Neumann regular rings of generalized power series ⋮ A methodology for designing proof rules for fair parallel programs ⋮ Countably complementable linear orderings ⋮ Computable models of theories with few models ⋮ A compendium of fuzzy weak orders: representations and constructions ⋮ Maximal chains of copies of the rational line ⋮ Generalizations of semiorders: A review note ⋮ Posets of copies of countable scattered linear orders ⋮ Reversible disjoint unions of well orders and their inverses ⋮ Epimorphisms between linear orders. ⋮ Pairs of orthogonal countable ordinals ⋮ Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs ⋮ Sheaf representations of MV-algebras and lattice-ordered abelian groups via duality ⋮ An undecidable property of context-free linear orders ⋮ Iterated elementary embeddings and the model theory of infinitary logic ⋮ Isotone extensions and complete lattices ⋮ Modal logics of Stone spaces ⋮ Homomorphisms between complete chains and the independence of the axioms of limitoid ⋮ The root system of prime subgroups of a free lattice-ordered group (without G.C.H.) ⋮ The structure of computably enumerable preorder relations ⋮ Definability with bounded number of bound variables ⋮ Computability-theoretic and proof-theoretic aspects of partial and linear orderings ⋮ Cuts of linear orders ⋮ Classification of finite coloured linear orderings ⋮ Self complementary topologies and preorders ⋮ Simple types in discretely ordered structures ⋮ Maximal chains of isomorphic subgraphs of the Rado graph ⋮ Model theory of the regularity and reflection schemes ⋮ Rings of generalized power series: Nilpotent elements ⋮ The weakness of being cohesive, thin or free in reverse mathematics ⋮ Computable linear orders and the Ershov hierarchy ⋮ Cops and robbers ordinals of cop-win trees ⋮ Fields: Algebraically closed and others ⋮ Countable linear orders with disjoint infinite intervals are mutually orthogonal ⋮ Towards an axiomatization of orderings ⋮ The \(\aleph_{0}\)-categorical trees ⋮ The complexity of isomorphism for complete theories of linear orders with unary predicates ⋮ Combinatorial properties of ultrametrics and generalized ultrametrics ⋮ Weakly semirecursive sets and r.e. orderings ⋮ On the structure of order domains ⋮ Representable lexicographic products ⋮ Characterizations of standard elements in posets ⋮ The equational theory of regular words ⋮ Transfinite product reduction in fundamental groupoids ⋮ Logic and rational languages of words indexed by linear orderings ⋮ Notes on leximorphic spaces ⋮ The space of real places on \(\mathbb{R}(x; y)\) ⋮ Reversibility of disconnected structures ⋮ Categoricity spectra of computable structures ⋮ Computable linear orders and limitwise monotonic functions ⋮ Computable presentability of countable linear orders ⋮ Degree spectra of the successor relation of computable linear orderings ⋮ Scattered subsets of \(\mathbb{Q}\) ⋮ Continuous Fraïssé conjecture ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ The range of ultrametrics, compactness, and separability ⋮ Coloring chains ⋮ Computable embeddings for pairs of linear orders ⋮ Products of chains with monochromatic maximal chains and antichains ⋮ Ordered sets with no chains of ideals of a given type ⋮ Measuring intransitivity ⋮ On Fraïssé's conjecture for linear orders of finite Hausdorff rank ⋮ Verifiable properties of database transactions ⋮ Ultrafilter selection and Corson compacta ⋮ Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) ⋮ Pointwise Debreu lexicographic powers ⋮ Querying spatial databases via topological invariants ⋮ Decidable fragments of first-order temporal logics ⋮ Star-free sets of words on ordinals ⋮ An infinite hierarchy of temporal logics over branching time ⋮ Lawless order ⋮ On HCO spaces. An uncountable compact \(T_ 2\) space, different from \(\aleph_ 1+1\), which is homeomorphic to each of its uncountable closed subspaces ⋮ Recursive automorphisms of recursive linear orderings ⋮ Well-orders realized by C.E. equivalence relations ⋮ A note on computable embeddings for ordinals and their reverses ⋮ Efficient solution of the word problem in slim varieties ⋮ Representations of free lattice-ordered groups ⋮ Existence of a semicontinuous or continuous utility function: a unified approach and an elementary proof. ⋮ The rise of non-Archimedean mathematics and the roots of a misconception. I: The emergence of non-Archimedean systems of magnitudes ⋮ On the degrees of constructively immune sets ⋮ First-order theories of bounded trees

This page was built for publication: