Related papers: Semantic Limits of Positive Existential Reasoning …
We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…
The notion of an Ohm-Rush algebra, and its associated content map, has connections with prime characteristic algebra, polynomial extensions, and the Ananyan-Hochster proof of Stillman's conjecture. As further restrictions are placed…
Using the concepts of Hyperbolic Classification of Natural Numbers, Essential Regions and Goldbach Conjecture Function we prove that the existence of a proof of the Goldbach Conjecture in First-Order Arithmetic would imply the existence of…
It is shown that the K-theory of every noetherian base scheme of finite Krull dimension is represented by a strict ring object in the setting of motivic stable homotopy theory. The adjective `strict' is used to distinguish between the type…
Furstenberg--Zimmer structure theory refers to the extension of the dichotomy between the compact and weakly mixing parts of a measure preserving dynamical system and the algebraic and geometric descriptions of such parts to a conditional…
The existence of a maximal ideal in a general nontrivial commutative ring is tied together with the axiom of choice. Following Berardi, Valentini and thus Krivine but using the relative interpretation of negation (that is, as "implies 0 =…
Classical mathematical models used in the semantics of programming languages and computation rely on idealized abstractions such as infinite-precision real numbers, unbounded sets, and unrestricted computation. In contrast, concrete…
The Abella interactive theorem prover has proven to be an effective vehicle for reasoning about relational specifications. However, the system has a limitation that arises from the fact that it is based on a simply typed logic:…
The causal structure of space-time offers a natural notion of an opposite or orthogonal in the logical sense, where the opposite of a set is formed by all points non time-like related with it. We show that for a general space-time the…
The long-standing problem of time in canonical quantum gravity is the source of several conceptual and technical issues. Here, recent mathematical results are used to provide a consistent algebraic formulation of dynamical symplectic…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
In this article we extend the notion of expansivity from topological dynamics to automorphisms of commutative rings with identity. We show that a ring admits a 0-expansive automorphism if and only if it is a finite product of local rings.…
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
A celebrated result by M. Davis, H. Putnam, J. Robinson, and Y. Matiyasevich shows that a set of integers is listable if and only if it is positive existentially definable in the language of arithmetic. We investigate analogues of this…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg's algebraic approach to characterization results in on judgment…
Can scientific discovery be made arbitrarily easy by choosing the right representation, collecting enough data, and deploying sufficiently powerful algorithms? This paper argues that the answer is fundamentally negative. We introduce the…
Large language models (LLMs) demonstrate remarkable reasoning capabilities, yet their performance often deteriorates sharply in long-horizon tasks, exhibiting systematic breakdown beyond certain scales. Conventional explanations primarily…
In this paper we extend of the notion of algebraically closed given in the case of groups and skew fields to an arbitrary h-inductive theory. The main subject of this paper is the study of the notion of positive algebraic closedness and its…