Related papers: The many faces of omega-logic
First-order logic is typically presented as the study of deduction in a setting with elementary quantification. In this paper, we take another vantage point and conceptualize first-order logic as a linear space that encodes "plausibility".…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…
We characterise functions for the dual spaces of entire functions f such that fe^{-\phi}\in L^p(\C^n,\rho^{-2}dA), 0<p\leq 1, where \phi is a subharmonic weight and \rho^{-2} is a positive function called under certain conditions…
We recently described a formalism for reasoning with if-then rules that re expressed with different levels of firmness [18]. The formalism interprets these rules as extreme conditional probability statements, specifying orders of magnitude…
S-metric and b-metric spaces are metrizable, but it is still quite impossible to get an explicit form of the concerned metric function. To overcome this, the notion of $\phi$-metric is developed by making a suitable modification in triangle…
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…
We rely on the strength of linguistic and philosophical perspectives in constructing a framework that offers a unified explanation for presuppositions and existential commitment. We use a rich ontology and a set of methodological principles…
We generalize the notion of saturated order to infinite partial orders and give both a set-theoretic and an algebraic characterization of such orders. We then study the proof theoretic strength of the equivalence of these characterizations…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
If $X$ is Frobenius split, then so is its normalization and we explore conditions which imply the converse. To do this, we recall that given an $\mathcal{O}_X$-linear map $\phi : F_* \mathcal{O}_X \to \mathcal{O}_X$, it always extends to a…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…
We propose a formal method to declare that findings from a primary study have been replicated in a follow-up study. Our proposal is appropriate for primary studies that involve large-scale searches for rare true positives (i.e. needles in a…
This paper presents a formal theory of Krivine's classical realisability interpretation for first-order Peano arithmetic ($\mathsf{PA}$). To formulate the theory as an extension of $\mathsf{PA}$, we first modify Krivine's original…
Since Austin introduced the term ``infelicity'', the linguistic literature has been flooded with its use, but no formal or computational explanation has been given for it. This thesis provides one for those infelicities that occur when a…
We study the logical complexity of proofs in cyclic arithmetic ($\mathsf{CA}$), as introduced in Simpson '17, in terms of quantifier alternations of formulae occurring. Writing $C\Sigma_n$ for (the logical consequences of) cyclic proofs…
In this paper we examine various requirements on the formalisation choices under which self-reference can be adequately formalised in arithmetic. In particular, we study self-referential numberings, which immediately provide a strong notion…
Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth. The idea is to start with a collection…
Let $\pi: X \to Y$ be a morphism of projective varieties and suppose that $\alpha$ is a pseudo-effective numerical cycle class satisfying $\pi_*\alpha = 0$. A conjecture of Debarre, Jiang, and Voisin predicts that $\alpha$ is a limit of…
Many-valued logics in general, and fuzzy logics in particular, usually focus on a notion of consequence based on preservation of full truth, typical represented by the value 1 in the semantics given the real unit interval [0,1]. In a recent…