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

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, Unnamed Item, Euclidean algorithm for a class of linear orders, A class of low linear orders having computable presentations, ON COHESIVE POWERS OF LINEAR ORDERS, Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words, ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS, Sharp Vaught's conjecture for some classes of partial orders, The 𝜔-Vaught’s conjecture, Lexicographic preference representation: intrinsic length of linear orders on infinite sets, Big Ramsey spectra of countable chains, First-order separation over countable ordinals, Computable reducibility for computable linear orders of type \(\omega \), On minimal non-\(\sigma\)-scattered linear orders, Minimum‐sized Infinite Partitions of Boolean Algebras, Unnamed Item, Unnamed Item, Up to equimorphism, hyperarithmetic is recursive, Lexicographic exponentiation of chains, An undecidable linear order that is \(n\)-decidable for all \(n\), Hierarchies of probabilistic and team FIN-learning, On dot-depth two, Tree-Automatic Well-Founded Trees, Decidable Expansions of Labelled Linear Orderings, Logic and rational languages of scattered and countable series-parallel posets, Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders, An inside/outside Ramsey theorem and recursion theory, On square-increasing ordered monoids and idempotent semirings, The role of measurability in game-theoretic probability, Equational Theories of Scattered and Countable Series-Parallel Posets, Reverse Mathematics: The Playground of Logic, On countable chains having decidable monadic theory, On the Ehrenfeucht-Fraïssé game in theoretical computer science, Limited Set quantifiers over Countable Linear Orderings, ALMOST GALOIS ω-STABLE CLASSES, Transfinite Lyndon Words, First-order properties of trees, star-free expressions, and aperiodicity, Automorphism groups of countably categorical linear orders are extremely amenable, A hierarchy of chains embeddable into the lexicographic power \(({\mathbb{R}}^\omega,\prec_{\text{lex}})\), Ehrenfeucht-Fraïssé games on ordinals, Computable linearizations of well-partial-orderings, Nonisomorphism of lattices of recursively enumerable sets, THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS, RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS, There is no classification of the decidably presentable structures, Axiomatizing omega and omega-op powers of words, ORDER TYPES OF MODELS OF FRAGMENTS OF PEANO ARITHMETIC, Equimorphy: the case of chains, Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n)), Monadic Theory of a Linear Order Versus the Theory of its Subsets with the Lifted Min/Max Operations, Vaught's conjecture for monomorphic theories, Automata Presenting Structures: A Survey of the Finite String Case, On weakly holographic structures, EHRENFEUCHT-FRAÏSSÉ GAMES ON A CLASS OF SCATTERED LINEAR ORDERS, Degrees coded in jumps of orderings, Boolean algebras, Stone spaces, and the iterated Turing jump, On frontiers of regular trees, Finite dimensional scattered posets, Some Questions in Computable Mathematics, Complexity of \(\Sigma^0_n\)-classifications for definable subsets, Unnamed Item, Rigid chains admitting many embeddings, On countably saturated linear orders and certain class of countably saturated graphs, Prime models of theories of computable linear orderings, The Order Type of Scattered Context-Free Orderings of Rank One Is Computable, The Valuation Difference Rank of a Quasi-Ordered Difference Field, Fréchet Borel ideals with Borel orthogonal, Modèles saturés et modèles engendrés par des indiscernables, Lexicographic TAF Algebras, Regular Languages of Words over Countable Linear Orderings, Isomorphism of Regular Trees and Words, Recursive Linear Orders with Incomplete Successivities, The -spectrum of a linear order, A universal coanalytic linear ordering, The length of chains in modular algebraic lattices, Filling certain cuts in discrete weakly o-minimal structures, Limitwise monotonic functions relative to the Kleene's ordinal notation system, Codings on linear orders and algorithmic independence of natural relations, Ultrafilter extensions of linearly ordered sets., Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders., R. e. presented linear orders, Forcing with copies of countable ordinals, Universality of embeddability relations for coloured total orders, Large families of mutually embeddable vertex-transitive graphs, Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers, On the Equimorphism Types of Linear Orderings, An application of the Ehrenfeucht-Fraisse game in formal language theory, A poset hierarchy, Complementation of Branching Automata for Scattered and Countable N-Free Posets, Every Low Boolean Algebra is Isomorphic to a Recursive One, Pro-aperiodic monoids via saturated models, Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings, Dense products in fundamental groupoids, Foundations of BQO Theory, Amenable equivalence relations and Turing degrees, Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result., AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS, Stationarily ordered types and the number of countable models, The full binary tree cannot be interpreted in a chain, Monotone Reducibility Over the Cantor Space, Selection in the monadic theory of a countable ordinal, Scattered products in fundamental groupoids, An Analysis of the Fuller Phenomenon on Transfinite Hybrid Automata, Two first-order logics of permutations, Thin set theorems and cone avoidance, ALGEBRAIC LINEAR ORDERINGS, Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets, Fences, their endpoints, and projective Fraïssé theory, Linear orders: When embeddability and epimorphism agree, On Kierstead’s conjecture, On the classification of vertex-transitive structures, The differential rank of a differential-valued field, On holographic structures, Orthogonal countable linear orders, Unnamed Item, On computable self-embeddings of computable linear orderings, Super-Rigid Families of Strongly Blackwell Spaces, The ordinal generated by an ordinal grammar is computable, The isomorphism problem on classes of automatic structures with transitive relations, Factorization in Operator Algebras, A VALUATION THEORETIC CHARACTERIZATION OF RECURSIVELY SATURATED REAL CLOSED FIELDS, Square roots and continuity in strictly linearly ordered semigroups on real intervals, VAUGHT’S CONJECTURE FOR ALMOST CHAINABLE THEORIES, APPROXIMATING TREES AS COLOURED LINEAR ORDERS AND COMPLETE AXIOMATISATIONS OF SOME CLASSES OF TREES, Periodicity and roots of transfinite strings