相关论文: Semantic A-translation and Super-consistency entai…
In intuitionistic mathematics, the Brouwer Continuity Theorem states that all total real functions are (uniformly) continuous on the unit interval. We study this theorem and related principles from the point of view of Reverse Mathematics…
We investigate a recent proposal for modal hypersequent calculi. The interpretation of relational hypersequents incorporates an accessibility relation along the hypersequent. These systems give the same interpretation of hypersequents as…
By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…
We present a constructive formalization of Abstract Rewriting Systems (ARS) in the Agda proof assistant, focusing on standard results in term rewriting. We define a taxonomy of concepts related to termination and confluence and investigate…
Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…
We present an illative system I_s of classical higher-order logic with subtyping and basic inductive types. The system I_s allows for direct definitions of partial and general recursive functions, and provides means for handling functions…
In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…
We investigate different notions of recognizability for a free monoid morphism $\sigma: \mathcal{A}^* \to \mathcal{B}^*$. Full recognizability occurs when each (aperiodic) point in $\mathcal{B}^\mathbb{Z}$ admits at most one tiling with…
We define various formal moduli spaces of p-divisible groups which are regular, and morphisms between them. We formulate arithmetic transfer conjectures, which are variants of the arithmetic fundamental lemma conjecture of the third author…
It is well-known that extending the Hilbert axiomatic system for first-order intuitionistic logic with an exclusion operator, that is dual to implication, collapses the domains of models into a constant domain. This makes it an interesting…
The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to…
Let A be a collection of n linear hyperplanes in k^l, where k is an algebraically closed field. The Orlik-Terao algebra of A is the subalgebra R(A) of the rational functions generated by reciprocals of linear forms vanishing on hyperplanes…
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages,…
Let $R\to A$ be a homomorphism of associative rings, and let $(\mathcal F,\mathcal C)$ be a hereditary complete cotorsion pair in $R\mathsf{-Mod}$. Let $(\mathcal F_A,\mathcal C_A)$ be the cotorsion pair in $A\mathsf{-Mod}$ in which…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…
We define a notion of model for the $\lambda$$\Pi$-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the $\lambda$$\Pi$-calculus modulo any…
In this paper, we study a class of cellular automata (CA) called stable cellular automata (SCA) that preserve stability by reflection, modulo-recurrent, and richness. After applying these automata to Sturmian words, we determine some of…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
We study the expressive power of subrecursive probabilistic higher-order calculi. More specifically, we show that endowing a very expressive deterministic calculus like G\"odel's $\mathbb{T}$ with various forms of probabilistic choice…