Related papers: Avoiding Contradictions in the Paradoxes, the Halt…
Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…
An influential argument for scientific realism posits that, if scientific theories were not true, their empirical success would be a coincidence. Here, I show that the false Drude's theory succeeds in explaining the Wiedemann-Franz law by…
The use of logical systems for problem-solving may be as diverse as in proving theorems in mathematics or in figuring out how to meet up with a friend. In either case, the problem solving activity is captured by the search for an…
The main subjects of this text are: (1) Generalization of concepts and operations, like distance and size, to situations where they are not definable in the usual way. (2) A pragmatic theory of handling contradictions using reliability of…
This short note introduces a formal system of truth and paradoxicality, outlining the main motivation, and proving its $\omega$-consistency. The system is called TP, for 'Truth and Paradoxicality'.
In this paper, we argue that while the concept of a set-theoretic paradox (or paradoxical set) can be relatively well-defined within a formal setting, the concept of a set-theoretic hypodox (or hypodoxical set) remains significantly less…
In this paper I study the connection between logic and metaphysics in Plato's participation theory, from the structural properties of the latter. Although Plato was the first ever to formulate the contradiction principle explicitly (in the…
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…
In this paper we concentrate on the nature of the liar paradox as a cognitive entity; a consistently testable configuration of properties. We elaborate further on a quantum mechanical model [Aerts, Broekaert, Smets 1999] that has been…
This paper revisits the foundations of mathematical proof through the lens of Aristotle's threefold conception of truth: sensory evidence, axiomatic definition, and syllogistic deduction. I argue that modern mathematics has too often…
LP$^{\supset,\mathsf{F}}$ is a three-valued paraconsistent propositional logic which is essentially the same as J3. It has most properties that have been proposed as desirable properties of a reasonable paraconsistent propositional logic.…
It is often argued that superluminal velocities and nontrivial spacetime topologies, allowed by the theory of relativity, may lead to causal paradoxes. By emphasizing that the notion of causality assumes the existence of a time arrow (TA)…
The paper introduces a propositional linguistic logic that serves as the basis for automated uncertain reasoning with linguistic information. First, we build a linguistic logic system with truth value domain based on a linear symmetrical…
Beginning with a simple semantics for propositions, based on counting observations, it is shown that probabilistic and fuzzy logic correspond to two different heuristic assumptions regarding the combination of propositions whose evidence…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
The paper analizes a set of issues related to analogy and analogical reasoning, namely: 1) The problem of analogy and its duplicity; 2) The role of analogy in demonstrative reasoning; 3) The role of analogy in non-demonstrative reasoning;…
Recently, the educational initiative TED-Ed has published a popular brain teaser coined the 'frog riddle', which illustrates non-intuitive implications of conditional probabilities. In its intended form, the frog riddle is a reformulation…
After examining the {\bf P} versus {\bf NP} problem against the Kleene-Rosser paradox of the $\lambda$-calculus [94], it was found that it represents a counter-example to NP-completeness. We prove that it contradicts the proof of Cook's…
In this paper we address the problem of handling inconsistencies in tables with missing values (also called nulls) and functional dependencies. Although the traditional view is that table instances must respect all functional dependencies…
When proving theorems from large sets of logical assertions, it can be helpful to restrict the search for a proof to those assertions that are relevant, that is, closely related to the theorem in some sense. For example, in the Watson…