Related papers: Recognizable Realizability
We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…
We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability…
Given a represented space (in the sense of TTE theory), an appropriate representation is constructed for the Moschovakis extension of its carrier (with paying attention to the cases of effective topological spaces and effective metric…
We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…
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…
Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…
Given a subset of $X\subseteq \mathbb{R}^{n}$ we can associate with every point $x\in \mathbb{R}^{n}$ a vector space $V$ of maximal dimension with the property that for some ball centered at $x$, the subset $X$ coincides inside the ball…
We use the technique of "classical realizability" to build new models of ZF + DC in which R is not well ordered. This gives new relative consistency results, probably not obtainable by forcing. This gives also a new method to get programs…
Until the 1970s, proof theoretic investigations were mainly concerned with theories of inductive definitions, subsystems of analysis and finite type systems. With the pioneering work of Gerhard Jaeger in the late 1970s and early 1980s, the…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
With every pca $\mathcal{A}$ and subpca $\mathcal{A}_\#$ we associate the nested realizability topos $\mathsf{RT}(\mathcal{A},\mathcal{A}_\#)$ within which we identify a class of small maps $\mathcal{S}$ giving rise to a model of…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
The equivalence of realizable and agnostic learnability is a fundamental phenomenon in learning theory. With variants ranging from classical settings like PAC learning and regression to recent trends such as adversarially robust learning,…
When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
This paper focuses on causal representation learning (CRL) under a general nonparametric latent causal model and a general transformation model that maps the latent data to the observational data. It establishes identifiability and…
We study the properties of the constructible universe, L, over intuitionistic theories. We give an extended set of fundamental operations which is sufficient to generate the universe over Intuitionistic Kripke-Platek set theory without…
There are investigated the generalized methods of cognition of the Existing, i.e. everything that is able to influence to the cognizer, and everything differed from the Existing is postulated as indistinguishable from the non-existing and…