Related papers: Ruitenburg's Theorem Mechanized and Contextualized
We construct a period regulator for motivic cohomology of an algebraic scheme over a subfield of the complex numbers. For the field of algebraic numbers we formulate a period conjecture for motivic cohomology by saying that this period…
We examine the interplay between projectivity (in the sense that was introduced by S.~Ghilardi) and uniform post-interpolant for the classical and intuitionistic propositional logic. More precisely, we explore whether a projective…
Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empirical dynamic…
In this paper we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi. This solves a problem that has been open for almost thirty years since it had been posed in Simpson's PhD thesis in 1994. We…
In 1938, Tarski proved that a formula is not intuitionistically valid if, and only if, it has a counter-model in the Heyting algebra of open sets of some topological space. In fact, Tarski showed that any Euclidean space R^n with n >= 1…
We show that a set of linearly independent quantum states $\{(U_{m,n}\otimes I)\rho ^{AB}(U_{m,n}^{\dagger}\otimes I)\}_{m,n=0}^{d-1}$, where $U_{m,n}$ are generalized Pauli matrices, cannot be discriminated deterministically or…
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…
We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…
Quantum mechanics has been subject to logical scrutiny since its inception. The behavior of quantum systems, which are fundamentally dissimilar from classical systems, often appears to point to a logical inconsistency in quantum mechanics,…
Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…
We show that the computational power of the non-causal circuit model, i.e., the circuit model where the assumption of a global causal order is replaced by the assumption of logical consistency, is completely characterized by the complexity…
By using ideas on complexity and randomness originally suggested by the mathematician-philosopher Gottfried Leibniz in 1686, the modern theory of algorithmic information is able to show that there can never be a "theory of everything" for…
In this article, we investigate observability-related properties of the Korteweg-de Vries equation with a discontinuous main coefficient, coupled by suitable interface conditions. The main result is a novel two-parameter Carleman estimate…
Principal component analysis (PCA) is a powerful tool for dimensionality reduction. Unfortunately, it is sensitive to outliers, so that various robust PCA variants were proposed in the literature. Among them the so-called rotational…
We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Goedel-McKinsey-Tarski-Artemov definition of Intuitionistic Logic as…
We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of…
The Rotar central limit theorem is a remarkable theorem in the non-classical version since it does not use the condition of asymptotic infinitesimality for the independent individual summands, unlike the theorems named Lindeberg's and…
The rationalizability concept was introduced in \cite{Ber84} and \cite{Pea84} to assess what can be inferred by rational players in a non-cooperative game in the presence of common knowledge. However, this notion can be defined in a number…
Regarding Euler's odd-strict theorem, which is the most basic partition identity, A refinement was done by Sylvester, and it was generalized by Bessenrodt to the r-regular and r-class regular cases. In this paper, we focus on the…
Gradual dependent types can help with the incremental adoption of dependently typed code by providing a principled semantics for imprecise types and proofs, where some parts have been omitted. Current theories of gradual dependent types,…