Related papers: The Core Logic Paradox
While paradoxical linkages famously violate the Chebyshev-Grubler-Kutzbach criterion by exhibiting unexpected mobility, we identify an opposing phenomenon: a class of linkages that appear mobile according to the same criterion, yet are in…
We present a new system S for handling uncertainty in a quantified modal logic (first-order modal logic). The system is based on both probability theory and proof theory. The system is derived from Chisholm's epistemology. We concretize…
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
The apparently trifling unexpected hanging paradox has generated an enormous philosophical literature. We introduce the mathematician to this literature, paying special attention to aspects that involve nontrivial mathematics. This xxx…
We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set \Gamma intuitively means…
One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…
The article reconsiders the position of the foundations of mathematics after the discovery of HoTT. Discussion that this discovery has generated in the community of mathematicians, philosophers and computer scientists might indicate a new…
A classical probabilistic explanation for Hardy's quantum paradox is demonstrated.
Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…
We introduce and investigate a family of consequence relations with the goal of capturing certain important patterns of data-driven inference. The inspiring idea for our framework is the fact that data may reject, possibly to some degree,…
On the basis of elementary thinking about language functioning, a solution of truth paradoxes is given and a corresponding semantics of a truth predicate is founded. It is shown that it is precisely the two-valued description of the maximal…
In our previous research, we provided a reasoning system (called LeSAC) based on argumentation theory to provide legal support to designers during the design process. Building on this, this paper explores how to provide designers with…
The automated proof search system and decidability for logic of correlated knowledge is presented in this paper. The core of the proof system is the sequent calculus with the properties of soundness, completeness, admissibility of cut and…
This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by it is a proper superset of the basic logic induced…
The problem of absolute motion in the context of the twin paradox is discussed. It is shown that the various versions of the clock paradox feature some aspects which Mach might have been appreciated. However, the ultimate cause of the…
We present an implementation of a probabilistic first-order logic called TensorLog, in which classes of logical queries are compiled into differentiable functions in a neural-network infrastructure such as Tensorflow or Theano. This leads…
Parrondo's paradox arises in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. We present a suitable version…
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,…
This paper provides a novel metametaphysical approach to quantum indeterminacy. More specifically, it argues that bivalent quantum logic can successfully account for this kind of indeterminacy, given the non-truth-functional character of…