English
Related papers

Related papers: Is there a duality in the classical acceptance of …

200 papers

Regarding the famous Sea Battle Argument, which Aristotle presents in De Interpretatione 9, there has never been a general agreement not only about its correctness but also, and mainly, about what the argument really is. According to the…

History and Overview · Mathematics 2023-03-28 Luiz Henrique Lopes dos Santos

It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…

Logic in Computer Science · Computer Science 2022-07-12 Zvi Schreiber

The recapture relationship is an important element to any understanding of the connexion between different systems of logic. Loosely speaking, one system of logic recaptures another if it is possible to specify a subsystem of the former…

Logic · Mathematics 2007-05-23 Andrew Aberdein

On the one hand, classical logic is an extremely successful theory, even if not being perfect. On the other hand, intuitionistic logic is, without a doubt, one of the most important non-classical logics. But, how can proponents of one logic…

Logic in Computer Science · Computer Science 2022-04-15 Satoru Niki , Hitoshi Omori

Translations between different nonmonotonic formalisms always have been an important topic in the field, in particular to understand the knowledge-representation capabilities those formalisms offer. We provide such an investigation in terms…

Artificial Intelligence · Computer Science 2014-01-17 Wolfgang Dvorak , Stefan Woltran

Every countable language which conforms to classical logic is shown to have an extension which conforms to classical logic, and has a definitional theory of truth. That extension has a semantical theory of truth, if every sentence of the…

Logic · Mathematics 2020-02-04 Seppo Heikkilä

The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…

Computational Complexity · Computer Science 2026-05-26 Arne Hole

In this paper, we discuss a well-known self-referential paradox in foundational game theory, the Brandenburger - Keisler paradox. We approach the paradox from two different perspectives: non-well-founded set theory and paraconsistent logic.…

Computer Science and Game Theory · Computer Science 2011-07-26 Can Baskent

Tarski's semantic definition of truth is the composition of its extensional and intensional aspects. Abstract satisfaction, the core of the semantic definition of truth, is the basis for the theory of institutions (Goguen and Burstall). The…

Logic in Computer Science · Computer Science 2018-11-07 Robert E. Kent

Classical evaluations of configurations of intertwined quantum contexts induce relations, such as true-implies-false, true-implies-true, but also nonseparability among the input and output terminals. When combined, these exploitable…

Quantum Physics · Physics 2020-05-14 Karl Svozil

In the early twentieth century, L.E.J. Brouwer pioneered a new philosophy of mathematics, called intuitionism. Intuitionism was revolutionary in many respects but stands out -mathematically speaking- for its challenge of Hilbert's formalist…

Logic · Mathematics 2017-08-22 Sam Sanders

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

Logic · Mathematics 2007-05-23 Wilfrid Hodges , Saharon Shelah

Goedel's explicit thesis was that his undecidable formula GUS is a well-formed, well-defined formal sentence in any formalisation of Intuitive Arithmetic IA in which the axioms and rules of inference are recursively definable. His implicit…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

Biomedical ontologies contain numerous concept or role names involving negative knowledge such as lacks_part, absence_of. Such a representation with labels rather than logical constructors would not allow a reasoner to interpret lacks_part…

Logic in Computer Science · Computer Science 2026-03-20 Chan Le Duc , Ludovic Brieulle

This article presents a computational semantics for classical logic using constructive type theory. Such semantics seems impossible because classical logic allows the Law of Excluded Middle (LEM), not accepted in constructive logic since it…

Logic in Computer Science · Computer Science 2014-09-02 Robert L. Constable

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

In this paper, we discuss necessary and sufficient explanations for formal argumentation - the question whether and why a certain argument can be accepted (or not) under various extension-based semantics. Given a framework with which…

Artificial Intelligence · Computer Science 2020-11-05 AnneMarie Borg , Floris Bex

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Carlos Gershenson

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

We outline an intuitionistic view of knowledge which maintains the original Brou\-wer-Heyting-Kolmogorov semantics for intuitionism and is consistent with the well-known approach that intuitionistic knowledge be regarded as the result of…

Logic · Mathematics 2019-02-20 Sergei Artemov , Tudor Protopopescu