English
Related papers

Related papers: Ordinal analysis of partial combinatory algebras

200 papers

We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…

Rings and Algebras · Mathematics 2019-09-16 Sebastian Kreinecker

We prove that if the linear-time and polynomial-time hierarchies coincide, then every model of $\Pi_1(\mathbb{N}) + \neg \Omega_1$ has a proper end-extension to a model of $\Pi_1(\mathbb{N})$, and so $\Pi_1(\mathbb{N}) + \neg \Omega_1…

Logic · Mathematics 2014-11-26 Leszek Aleksander Kołodziejczyk

Using relativized ordinal analysis, we give a proof-theoretic characterization of the provably total set-recursive-from-$\omega$ functions of KPl and related theories.

Logic · Mathematics 2025-10-17 Juan Pablo Aguilera , Anton Fernández , Joost J. Joosten

We continue the study of computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a…

Logic · Mathematics 2020-09-03 Nikolay Bazhenov , Stefan Vatev

Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…

Logic · Mathematics 2020-04-30 H. P. Barendregt , S. A. Terwijn

We propose a generalisation of concurrent Kleene algebra \cite{Hoa09} that can take account of probabilistic effects in the presence of concurrency. The algebra is proved sound with respect to a model of automata modulo a variant of rooted…

Formal Languages and Automata Theory · Computer Science 2013-01-31 Annabelle McIver , Tahiry Rabehaja , Georg Struth

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…

Combinatorics · Mathematics 2012-10-26 Emanuele Delucchi , Simona Settepanella

We study connections between closure operators on an algebra $(A,\Om)$ and congruences on the extended power algebra defined on the same algebra. We use these connections to give an alternative description of the lattice of all subvarieties…

Rings and Algebras · Mathematics 2015-08-18 Agata Pilitowska , Anna Zamojska-Dzienio

We examine the conformal property of the second Hamiltonian structure of constrained KP hierarchy derived by Oevel and Strampp. We find that it naturallygives a family of nonlocal extended conformal algebras. We give two examples of such…

High Energy Physics - Theory · Physics 2009-10-28 Wen-Jui Huang , J. C. Shaw , H. C. Yen

We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…

General Topology · Mathematics 2021-02-09 Paolo Lipparini

In the theory of combinatorial algebras, there is a sequence of embeddings between Kleene's second model, van Oosten's model, and Scott's graph model. We prove that none of these embeddings can be reversed. We also prove nonembedding…

Logic · Mathematics 2026-05-15 Patrick Lutz , Paul Shafer , Sebastiaan A. Terwijn

Let $\Gamma$ be a totally ordered group. We use Hahn's embedding theorem to construct a totally ordered set $\Gamma\subset \Gamma_{\operatorname{sme}}$ which classifies small extensions of $\Gamma$. This small-extensions closure…

Commutative Algebra · Mathematics 2020-11-12 Enric Nart

We give a new true-concurrent model for probabilistic concurrent Kleene algebra. The model is based on probabilistic event structures, which combines ideas from Katoen's work on probabilistic concurrency and Varacca's probabilistic prime…

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

Low-order hybridization expansion methods such as the non-crossing approximation (NCA) and the one-crossing approximation (OCA) are widely used impurity solvers in the study of strongly correlated systems, yet their accuracy in genuine…

Strongly Correlated Electrons · Physics 2026-05-05 Dolev Goldberger , Ido Zemach , Lei Zhang , Yang Yu , Emanuel Gull , Guy Cohen , André Erpenbeck

We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…

Logic · Mathematics 2013-06-28 Luca Motto Ros

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

Logic · Mathematics 2008-06-04 Wesley Calvert

In these lectures we study some possible higher order (of degree greater than two) extensions of the Poincar\'e algebra. We first give some general properties of Lie superalgebras with some emphasis on the supersymmetric extension of the…

High Energy Physics - Theory · Physics 2009-07-22 M. Rausch de Traubenberg

In this article we want to see that it is possible to iterate and generalize the notions presented in "Carlson's <_1-relation on the class of epsilon numbers" such that we can obtain the higher or thinner classes of ordinals induced by the…

Logic · Mathematics 2013-09-25 Parménides García Cornejo

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

Logic · Mathematics 2022-07-19 Deacon Linkhorn