English
Related papers

Related papers: Ordinal analysis of partial combinatory algebras

200 papers

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

Logic in Computer Science · Computer Science 2026-05-19 Lukas Mulder , Damien Pous , Jana Wagemaker

We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…

Logic · Mathematics 2018-04-24 Wesley Fussner , Alessandra Palmigiano

We study a quadruple of interrelated subexponential subsystems of arithmetic WKL$_0^-$, RCA$^-_0$, I$\Delta_0$, and $\Delta$RA$_1$, which complement the similarly related quadruple WKL$_0$, RCA$_0$, I$\Sigma_1$, and PRA studied by Simpson,…

Logic in Computer Science · Computer Science 2017-05-17 Ján Kľuka , Paul J. Voda

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

Logic · Mathematics 2017-02-23 Matthew Harrison-Trainor

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Logic · Mathematics 2022-08-04 Antonio Montalbán , Dino Rossegger

We construct and study the conformal loop ensembles CLE(kappa), defined for all kappa between 8/3 and 8, using branching variants of SLE(kappa) called exploration trees. The conformal loop ensembles are random collections of countably many…

Probability · Mathematics 2007-05-23 Scott Sheffield

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

Logic · Mathematics 2019-09-27 Nikolay Bazhenov , Manat Mustafa , Luca San Mauro , Mars Yamaleev

We define and study an $ \omega $-ary operation on the class of the ordinals, which is strictly monotone in many significant cases (by an elementary argument, there is no fully strictly monotone infinitary operation on ordinals). We compare…

Logic · Mathematics 2026-05-01 Paolo Lipparini

Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…

General Topology · Mathematics 2015-02-17 M. R. Koushesh

First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous…

Logic · Mathematics 2020-09-30 Brett McLean

In this paper, we show that the equational theory of relational Kleene algebra with the \emph{graph loop} operator (a.k.a.~\emph{fixset}) is \textsc{PSpace}-complete. Here, the graph loop is the unary operator that restricts a binary…

Logic in Computer Science · Computer Science 2026-05-01 Yoshiki Nakamura

We consider different classes of combinatory structures related to Krivine realizability. We show, in the precise sense that they give rise to the same class of triposes, that they are equivalent for the purpose of modeling higher-order…

We investigate from an algebraic and topological point of view the minimal prime spectrum of a universal algebra, considering the prime congruences w.r.t. the term condition commutator. Then we use the topological structure of the minimal…

Rings and Algebras · Mathematics 2024-09-04 George Georgescu , Leonard Kwuida , Claudia Mureşan

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

Logic · Mathematics 2018-02-12 Egor Ianovski , Keng Meng Ng , Russell Miller , Andre Nies

We focus on formulae $\exists X.\, \varphi(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < \omega_1$ of such a set $X$ measures its…

Logic in Computer Science · Computer Science 2025-12-16 Damian Niwiński , Paweł Parys , Michał Skrzypczak

We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove,…

Logic · Mathematics 2023-11-22 Juan P. Aguilera , Corey Bacal Switzer

We define and study basic properties of *-continuous Kleene $\omega$-algebras that involve a *-continuous Kleene algebra with a *-continuous action on a semimodule and an infinite product operation that is also *-continuous. We show that…

Formal Languages and Automata Theory · Computer Science 2015-01-07 Zoltán Ésik , Uli Fahrenberg , Axel Legay

We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of…

Logic in Computer Science · Computer Science 2013-06-13 Annabelle McIver , Tahiry Rabehaja , Georg Struth

This paper is mainly concerned with the relation-algebraical aspects of the well-known Region Connection Calculus (RCC). We show that the contact relation algebra (CRA) of certain RCC model is not atomic complete and hence infinite. So in…

Artificial Intelligence · Computer Science 2007-05-23 Yongming Li , Sanjiang Li , Mingsheng Ying

In a previous paper we introduced a version of associativity for a partial infinitary operation. We prove here that if $\gamma$ is an infinite ordinal and some associative infinitary operation is defined for all sequences indexed by…

Logic · Mathematics 2026-05-28 Paolo Lipparini