Related papers: The two halves of disjunctive correctness
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
In this note, we show that, despite the widespread assumption, the consistency formula for Peano Arithmetic PA, Con(PA), "for all x, x is not a code of a derivation of (0=1)," is not equivalent in PA to the consistency of PA. Specifically,…
In this paper we introduce a new type of differential equations with piecewise constant argument (EPCAG), more general than EPCA. The Reduction Principle is proved for EPCAG. The structure of the set of solutions is specified. We establish…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
We propose a new version of generalized probabilistic propositional logic, namely, discrete-continuous logic (DCL) in which every generalized proposition (GP) is represented as 2x2 nondiagonal positive matrix with unit trace. We demonstrate…
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]…
For each substance-like quantity, a theorem about its conservation or non-conservation can be formulated. For the electric charge e.g. it reads: Electric charge can neither be created nor destroyed. Such a statement is short and easy to…
We consider a 2-valued non-deterministic connective $\wedge \hskip-5.5pt \vee$ defined by the table resulting from the entry-wise union of the tables of conjunction and disjunction. Being half conjunction and half disjunction we named it…
In this paper, I have proved that for a class of polynomial differential systems of degree n+1 ( where n is an arbitrary positive integer) the composition conjecture is true. I give the sufficient and necessary conditions for these…
We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…
We investigate language interpretations of two extensions of the Lambek calculus: with additive conjunction and disjunction and with additive conjunction and the unit constant. For extensions with additive connectives, we show that…
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally…
We prove some theorems on decomposable continua. In particular, we prove; (i) the property of being a Wilder continuum is not a Whitney reversible property, (ii) inverse limits of D**-continua with surjective monotone upper semi-continuous…
In this paper we will study an important but rather technical result which is called The Reduction Property. The result tells us how much arithmetical conservation there is between two arithmetical theories. Both theories essentially speak…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
The paper explores applications of Kripke's theory of truth to semantics for anti-luck epistemology, that is, to subjunctive theories of knowledge. Subjunctive theories put forward modal or subjunctive conditions to rule out knowledge by…
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 introduce a method to construct conservation laws for a large class of linear partial differential equations. In contrast to the classical result of Noether, the conserved currents are generated by any symmetry of the operator, including…
We extend the $ASPIC^+$ framework for structured argumentation so as to allow applications of the reasoning by cases inference scheme for defeasible arguments. Given an argument with conclusion `$A$ or $B$', an argument based on $A$ with…