English
Related papers

Related papers: A Report on Realizability

200 papers

Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired…

Category Theory · Mathematics 2020-01-15 Thorsten Wißmann , Stefan Milius , Shin-ya Katsumata , Jérémy Dubut

A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offers a (co)algebraic framework for studying processes with algebraic branching structures and recursion operators. The framework captures Milner's algebra of regular…

Logic in Computer Science · Computer Science 2022-09-02 Todd Schmid

We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…

Logic · Mathematics 2022-12-14 Merlin Carl , Lorenzo Galeotti , Robert Passmann

We consider the sets of dimensions for which there is an optimal sphere packing with special regularity properties (respectively, a lattice, or a periodic set with a given bound on the number of translations, or an arbitrary periodic set).…

Information Theory · Computer Science 2022-12-13 Yuri Manin , Matilde Marcolli

Rice's theorem shows that nontrivial extensional properties of partial recursive functions are undecidable. For finite weighted Boolean optimization/CSP-style slices, a Rice-style structural analogue holds for tractability classification:…

Computational Complexity · Computer Science 2026-05-28 Tristan Simas

In 70's there was discovered a construction how to attach to some algebraic-geometric data an infinite-dimensional subspace in the space k((z)) of the Laurent power series. The construction was successfully used in the theory of integrable…

Algebraic Geometry · Mathematics 2007-05-23 A. N. Parshin

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very…

Logic · Mathematics 2016-04-05 Willem Conradie , Alessandra Palmigiano

This paper introduces effectful toposes as an extension of the effective topos and investigates their structure relative to Lawvere-Tierney topologies. First, we formulate effectful toposes by lifting the evidenced frame, which is a…

Logic in Computer Science · Computer Science 2026-02-27 Rinta Yamada

In 70's there was discovered a construction how to attach to some algebraic-geometric data an infinite-dimensional subspace in the space k((z)) of the Laurent power series. The construction is known as the Krichever correspondence. It was…

Algebraic Geometry · Mathematics 2009-12-16 A. N. Parshin

A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While…

Logic · Mathematics 2016-04-13 Benjamin G. Rin , Sean Walsh

Jacobs has proposed definitions for (weak, strong, split) generic objects for a fibered category; building on his definition of (split) generic objects, Jacobs develops a menagerie of important fibrational structures with applications to…

Logic in Computer Science · Computer Science 2023-03-10 Jonathan Sterling

The present paper constructs three new systems of clarithmetic (arithmetic based on computability logic --- see http://www.cis.upenn.edu/~giorgi/cl.html): CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally complete…

Logic in Computer Science · Computer Science 2012-11-21 Giorgi Japaridze

We investigate replicable learning algorithms. Ideally, we would like to design algorithms that output the same canonical model over multiple runs, even when different runs observe a different set of samples from the unknown data…

Machine Learning · Computer Science 2023-04-06 Peter Dixon , A. Pavan , Jason Vander Woude , N. V. Vinodchandran

In this paper we translate the necessary and sufficient conditions of Tanaka's theorem on the finiteness of effective prolongations of a fundamental graded Lie algebras into computationally effective criteria, involving the rank of some…

Differential Geometry · Mathematics 2019-10-21 Stefano Marini , Costantino Medori , Mauro Nacinovich

This article gives both an overview and supplements the articles [AF08] and [AF09] on the critical level category O over an affine Kac-Moody algebra. In particular, we study the restricted projective objects and review the restricted…

Representation Theory · Mathematics 2015-08-27 Peter Fiebig

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…

Representation Theory · Mathematics 2025-10-10 Abigail Price , Ada Stelzer , Alexander Yong

The paper studies the structure of restricted Leibniz algebras. More specifically speaking, we first give the equivalent definition of restricted Leibniz algebras, which is by far more tractable than that of a restricted Leibniz algebras in…

Rings and Algebras · Mathematics 2014-04-01 Baoling Guan , Liangyun Chen

This paper deals with the construction of a suitable topological $K$-theory capable of classifying topological phases of dynamically stable systems described by gapped $\eta$-self-adjoint operators on a Krein space with indefinite metric…

Mathematical Physics · Physics 2018-10-10 Giuseppe De Nittis , Kiyonori Gomi

We define a modification of the standard Kripke model, called the ordered Kripke model, by introducing a linear order on the set of accessible states of each state. We first show this model can be used to describe the lexicographic belief…

Econometrics · Economics 2018-01-29 Shuige Liu