相关论文: An Intermediate Logic Contained in Medvedev's Logi…

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…

In their seminal paper Birkhoff and von Neumann revealed the following dilemma: "... whereas for logicians the orthocomplementation properties of negation were the ones least able to withstand a critical analysis, the study of mechanics…

In this article, we deal with the uniform effective disjunction property and the uniform effective interpolation property, which are weaker versions of the classical effective disjunction property and the effective interpolation property.\\…

We propose a new dual description of four-dimensional $\mathcal{N}=1$ $SU(N)$ gauge theory with one adjoint ($X$) and $N_f$ fundamental matters with a superpotential $W = \text{Tr}\, X^{p+1}$. The dual theory consists of the…

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

We study topology, particularly compactness, as an extension of Shulman's work on constructive mathematics via affine logic, while allowing propositional impredicativity. We introduce a notion of compactness in affine logic and prove the…

We extend Natural Deduction for intuitionistic logic with a third introduction rule for the disjunction, $\vee$-i3, with a conclusion $\Gamma\vdash A\vee B$, but both premises $\Gamma\vdash A$ and $\Gamma\vdash B$. This rule is admissible…

This paper is a study of first-order coherent logic from the point of view of duality and categorical logic. We prove a duality theorem between coherent hyperdoctrines and open polyadic Priestley spaces, which we subsequently apply to prove…

We derive the effective superpotential for an N=1 SU(N_c) gauge theory with one massless adjoint field and N_f massless fundamental flavors and cubic tree-level superpotential for the adjoint field. This is a generalization of the…

Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…

Let K be a number field and let S be a finite set of places of K which contains all the Archimedean places. For any f(z) in K(z) of degree d at least 2 which is not a d-th power in \bar{K}(z), Siegel's theorem implies that the image set…

We prove the Moore and the Myhill property for strongly irreducible subshifts over right amenable and finitely right generated left homogeneous spaces with finite stabilisers. Both properties together mean that the global transition…

Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka et al. KR 2002) and answer set programming. Logic programming under answer set semantics is extended with a new connective called…

We systematically study several versions of the disjunction and the existence properties in modal arithmetic. First, we newly introduce three classes $\mathrm{B}$, $\Delta(\mathrm{B})$, and $\Sigma(\mathrm{B})$ of formulas of modal…

We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of all polytopes -- i.e., compact convex polyhedra -- denoted PL.…

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

We introduce a new propositional logic, called very weak subintuitionistic logic $\mathbf{VF}$, by adapting the relational semantics of Fitting, Marek, and Truszczy\'nski for the pure logic of necessitation $\mathbf{N}$ to the propositional…

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

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…

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…