Related papers: Classical determinate truth without induction
We generalize the classical mean value theorem of differential calculus by allowing the use of a Caputo-type fractional derivative instead of the commonly used first-order derivative. Similarly, we generalize the classical mean value…
We introduce a class of probabilistic theories, termed Minimal Strongly Causal Operational Probabilistic Theories, where system dynamics are constrained to the minimal set of operations consistent with the set of states and permitting…
Several recent results bring into focus the superintuitionistic nature of most notions of proof-theoretic validity, but little work has been done evaluating the consequences of these results. Proof-theoretic validity claims to offer a…
A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced. More precisely, after introducing this independence…
Stratified formulae were introduced by Quine as an alternative way to attack Russell's Paradox. Instead of limiting comprehension by size (as in $\mathsf{ZF}$ set theory, using its axiom scheme of separation), unlimited comprehension is…
The existence of an infinite set of conserved currents in completely integrable classical models, including chiral and Toda models as well as the KP and self-dual Yang-Mills equations, is traced back to a simple construction of an infinite…
The paper gives an operator algebras model for the conditional monotone independence, introduced by T. Hasebe. The construction is used to prove an embedding result for the N. Muraki's monotone product of C*-algebras. Also, the formulas…
We establish duality theory of p-adic unitary Banach representations of locally profinite groups. This is an extension of Iwasawa theory for profinite groups by P. Schneider and J. Teitelbaum. We also establish a criterion for an…
Plausible counterfactual explanations (p-CFEs) are perturbations that minimally modify inputs to change classifier decisions while remaining plausible under the data distribution. In this study, we demonstrate that classifiers can be…
The languages of logics based on team semantics typically only allow atomic negation or restricted negation. In this paper, we explore propositional team-based logics with full (intuitionistic) negation. We demonstrate that including full…
Every countable language which conforms to classical logic is shown to have an extension which conforms to classical logic, and has a definitional theory of truth. That extension has a semantical theory of truth, if every sentence of the…
Assuming that the Hamiltonian of a canonical field theory can be written in the form N H + N^i H_i, and using as the only input the actual choice of the canonical variables, we derive: (i) The algebra satisfied by H and H_i, (ii) any…
We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…
Field theories on canonical noncommutative spacetimes, which are being studied also in connection with string theory, and on $\kappa$-Minkowski spacetime, which is a popular example of Lie-algebra noncommutative spacetime, can be naturally…
In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
Propositional dynamic logic (PDL) is presented in Sch\"{u}tte-style mode as one-sided semiformal tree-like sequent calculus Seq$_\omega^{\text{pdl}}$ with standard cut rule and the omega-rule with principal formulas $\left[ P^{\ast }\right]…
We introduce the ring of Fermat reals, an extension of the real field containing nilpotent infinitesimals. The construction takes inspiration from Smooth Infinitesimal Analysis (SIA), but provides a powerful theory of actual infinitesimals…
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…
We construct a logic-enriched type theory LTTW that corresponds closely to the predicative system of foundations presented by Hermann Weyl in Das Kontinuum. We formalise many results from that book in LTTW, including Weyl's definition of…