scientific article; zbMATH DE number 3767656
From MaRDI portal
Publication:3949052
Cited in
(only showing first 100 items - show all)- Degree spectra of the successor relation of computable linear orderings
- Continuous Fraïssé conjecture
- On Fraïssé's conjecture for linear orders of finite Hausdorff rank
- Pointwise Debreu lexicographic powers
- Lawless order
- Recursive automorphisms of recursive linear orderings
- Complete embeddings of linear orderings and embeddings of lattice-ordered groups
- The metamathematics of scattered linear orderings
- Irrational ordered groups
- Cancellation and absorption of lexicographic powers of totally ordered Abelian groups
- Self complementary topologies and preorders
- Rings of generalized power series: Nilpotent elements
- Fields: Algebraically closed and others
- Weakly semirecursive sets and r.e. orderings
- Coloring chains
- Measuring intransitivity
- Verifiable properties of database transactions
- On HCO spaces. An uncountable compact \(T_ 2\) space, different from \(\aleph_ 1+1\), which is homeomorphic to each of its uncountable closed subspaces
- Efficient solution of the word problem in slim varieties
- Representations of free lattice-ordered groups
- Modulo-counting quantifiers over finite trees
- A partition relation for partially ordered sets
- Universality of the automorphism group of the real line
- Cardinals of countable cofinality and eventual domination
- The complexity of the fixed point property
- Characterizing rational versus exponential learning curves
- Semisimple rings and von Neumann regular rings of generalized power series
- A methodology for designing proof rules for fair parallel programs
- Computable models of theories with few models
- Generalizations of semiorders: A review note
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Querying spatial databases via topological invariants
- Decidable fragments of first-order temporal logics
- Generalized pigeonhole properties of graphs and oriented graphs
- Two equational theories of partial words
- Computable linear orders and the Ershov hierarchy
- Countable linear orders with disjoint infinite intervals are mutually orthogonal
- Representable lexicographic products
- Characterizations of standard elements in posets
- The equational theory of regular words
- The space of real places on \(\mathbb{R}(x; y)\)
- Scattered subsets of \(\mathbb{Q}\)
- Products of chains with monochromatic maximal chains and antichains
- Star-free sets of words on ordinals
- An infinite hierarchy of temporal logics over branching time
- Existence of a semicontinuous or continuous utility function: a unified approach and an elementary proof.
- A formal study of linearity axioms for fuzzy orderings
- The Debreu Gap Lemma and some generalizations
- An undecidable property of context-free linear orders
- Combinatorial properties of ultrametrics and generalized ultrametrics
- Transfinite product reduction in fundamental groupoids
- Reversibility of disconnected structures
- Categoricity spectra of computable structures
- Computable linear orders and limitwise monotonic functions
- Computable presentability of countable linear orders
- Weighted parsing for grammar-based language models over multioperator monoids
- The range of ultrametrics, compactness, and separability
- Computable embeddings for pairs of linear orders
- Ultrafilter selection and Corson compacta
- Well-orders realized by C.E. equivalence relations
- A note on computable embeddings for ordinals and their reverses
- On the degrees of constructively immune sets
- First-order theories of bounded trees
- First-order logic and its infinitary quantifier extensions over countable words
- Reversible disjoint unions of well orders and their inverses
- Isotone extensions and complete lattices
- The structure of computably enumerable preorder relations
- On countably saturated linear orders and certain class of countably saturated graphs
- 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.
- Pro-aperiodic monoids via saturated models
- Dense products in fundamental groupoids
- Stationarily ordered types and the number of countable models
- Two first-order logics of permutations
- On the classification of vertex-transitive structures
- The differential rank of a differential-valued field
- On holographic structures
- Orthogonal countable linear orders
- The ordinal generated by an ordinal grammar is computable
- Square roots and continuity in strictly linearly ordered semigroups on real intervals
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- On square-increasing ordered monoids and idempotent semirings
- The role of measurability in game-theoretic probability
- 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}})\)
- Computable linearizations of well-partial-orderings
- Equimorphy: the case of chains
- Vaught's conjecture for monomorphic theories
- Finite dimensional scattered posets
- The length of chains in modular algebraic lattices
- Universality of embeddability relations for coloured total orders
- A poset hierarchy
- Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
- Ehrenfeucht-Fraïssé games on ordinals
- Tree-automatic scattered linear orders
- A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases
- On weakly holographic structures
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3949052)
