相关论文: The two halves of disjunctive correctness
In ASPIC-style structured argumentation an argument can rebut another argument by attacking its conclusion. Two ways of formalizing rebuttal have been proposed: In restricted rebuttal, the attacked conclusion must have been arrived at with…
The paper proposes and studies new classical, type-free theories of truth and determinateness with unprecedented features. The theories are fully compositional, strongly classical (namely, their internal and external logics are both…
A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
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…
The material conditional has long been charged with paradox. Defined truth-functionally, it renders true any conditional whose antecedent is false or consequent true -- hence, seemingly absurd statements such as `If unicorns exist, then…
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…
The main purpose of this paper is to prove that the positive real numbers can be decomposed into finitely many disjoint pieces which are also closed under addition and multiplication. As a byproduct of the argument we determine all the…
For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…
Disjunctive Linear Arithmetic (DLA) is a major decidable theory that is supported by almost all existing theorem provers. The theory consists of Boolean combinations of predicates of the form $\Sigma_{j=1}^{n}a_j\cdot x_j \le b$, where the…
We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs…
This paper continues an established line of research about the relations between argumentation theory, particularly assumption-based argumentation, and different kinds of logic programs. In particular, we extend known result of Caminada,…
The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…
We provide decompositions of Dirichlet forms into recurrent and transient parts as well as into conservative and dissipative parts, in the framework of Hausdorff state spaces. Combining both formulae we write every Dirichlet form as the sum…
Recently, Artemov [4] offered the notion of constructive consistency for Peano Arithmetic and generalized it to constructive truth and falsity in the spirit of Brouwer-Heyting-Kolmogorov semantics and its formalization, the Logic of Proofs.…
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…
This note analyzes in terms of categorial proof theory some standard assumptions about negation in the absence of any other connective. It is shown that the assumptions for an involutive negation, like classical negation, make a kind of…
In distributed multi-agent systems, correctness is often entangled with operational policies such as scheduling, batching, or routing, which makes systems brittle since performance-driven policy evolution may break integrity guarantees.…
Nonlinear self-adjointness method for constructing conservation laws of partial differential equations (PDEs) is further studied. We show that any adjoint symmetry of PDEs is a differential substitution of nonlinear self-adjointness and…
A d.c. (delta-convex) function on a normed linear space is a function representable as a difference of two continuous convex functions. We show that an infinite dimensional analogue of Hartman's theorem on stability of d.c. functions under…