Search
Search Results
-
The Lattice of Definability: Origins, Recent Developments, and Further Directions
AbstractThis article presents results and open problems related to definability spaces (reducts) and sources of this field since the 19th century....
-
Modal Definability: Two Commuting Equivalence Relations
We prove that modal definability with respect to the class of all structures with two commuting equivalence relations is an undecidable problem. The...
-
On relatively elementary definability of graph classes in the class of semigroups
Based on the previously obtained concrete characterization of the endomorphism semigroups of quasi-acyclic reflexive graphs we prove the relatively...
-
Relatively Elementary Definability of the Class of Universal Graphic Semiautomata in the Class of Semigroups
AbstractAutomata theory is a branch of mathematical cybernetics that studies data conversion devices involved in many applied problems. This article...
-
Existential Definability of Unary Predicates in Büchi Arithmetic
The paper provides a complete characterisation of the sets $$S\subseteq \mathbb... -
Minimal Predicates for Δ-Definability
We consider two kinds of reducibilities on finite families of predicates on a countable set: the definability of predicates and their complements of...
-
Lattice of Definability in the Order of Rational Numbers
AbstractA lattice of definability subspaces in the order of rational numbers is described. It is proved that this lattice consists of five subspaces...
-
Creating New Mathematics by Schoolchildren
AbstractThe paper discusses an example of an educational project in modern mathematics in which school students create mathematics that is new to...
-
On Σ-Definability Over Hereditarily Finite and List Superstructures
We establish the reciprocal Σ-definability of the hereditarily finite superstructure and the hereditarily finite list superstructure over an...
-
-
Definability of Completely Decomposable Torsion-Free Abelian Groups by Semigroups of Endomorphisms and Groups of Homomorphisms
Let C be an Abelian group. A class X of Abelian groups is called a C E • H -class if for any groups A, B ∈ X , it follows from the existence of...
-
Semigroups of Relatively Continuous Binary Relations and Their Isomorphisms
AbstractAll isomorphisms between semigroups of relatively continuous binary relations defined on arbitrary topological spaces are described. As a...
-
On Mutual Definability of Operations on Fields
We study the possibilities of defining some operations on fields via the remaining operations. In particular, we prove that multiplication on an...
-
Ultravaluations and their Applications in \(\textsf{CPL}\)
This paper introduces the construct of an ultravaluation inspired by the well-known ultraproduct. Basic properties and exemplary applications of this...
-
Conservative Parametric Optimality and the Ridge Method for Tame Min-Max Problems
We study the ridge method for min-max problems, and investigate its convergence without any convexity, differentiability or qualification assumption....
-
The Relationship Between Local and Global Structure in the Enumeration Degrees
We discuss core ideas in degree theory including biinterpretability, automorphisms, and definability. We focus on the Turing degrees...