English
Related papers

Related papers: A note on the intuitionistic logic of false belief

200 papers

The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…

Logic · Mathematics 2018-04-30 Paolo Pistone

Can a physicist make only a finite number of errors in the eternal quest to uncover the law of nature? This millennium-old philosophical problem, known as inductive inference, lies at the heart of epistemology. Despite its significance to…

Machine Learning · Computer Science 2024-09-27 Zhou Lu

The classical view of epistemic logic is that an agent knows all the logical consequences of their knowledge base. This assumption of logical omniscience is often unrealistic and makes reasoning computationally intractable. One approach to…

Artificial Intelligence · Computer Science 2018-05-09 Yijia Chen , Abdallah Saffidine , Christoph Schwering

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

Predictive models are being increasingly used to support consequential decision making at the individual level in contexts such as pretrial bail and loan approval. As a result, there is increasing social and legal pressure to provide…

Machine Learning · Computer Science 2020-03-02 Amir-Hossein Karimi , Gilles Barthe , Borja Balle , Isabel Valera

In this paper we discuss contrastive explanations for formal argumentation - the question why a certain argument (the fact) can be accepted, whilst another argument (the foil) cannot be accepted under various extension-based semantics. The…

Artificial Intelligence · Computer Science 2022-01-26 AnneMarie Borg , Floris Bex

While a large body of work has scrutinized the meaning of conditional sentences, considerably less attention has been paid to formal models of their pragmatic use and interpretation. Here, we take a probabilistic approach to pragmatic…

Computation and Language · Computer Science 2022-10-14 Britta Grusdt , Daniel Lassiter , Michael Franke

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…

Logic · Mathematics 2021-09-07 Nicholas Pischke

Prawitz conjectured that the proof-theoretically valid logic is intuitionistic logic. Recent work on proof-theoretic validity has disproven this. In fact, it has been shown that proof-theoretic validity is not even closed under…

Logic · Mathematics 2022-11-24 Will Stafford , Victor Nascimento

For a newcomer, paraconsistent logics can be difficult to grasp. Even experts in logic can find the concept of paraconsistency to be suspicious or misguided, if not actually wrong. The problem is that although they usually have much in…

Logic · Mathematics 2013-12-17 Jesse Alama

Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a fully interpreted object language and from an extra formula a new language. It is fully interpreted under a suitably defined interpretation.…

Logic · Mathematics 2017-12-15 Seppo Heikkilä

We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract…

Logic in Computer Science · Computer Science 2023-07-25 Ulrich Berger , Hideki Tsuiki

Subset models provide a new semantics for justifcation logic. The main idea of subset models is that evidence terms are interpreted as sets of possible worlds. A term then justifies a formula if that formula is true in each world of the…

Logic in Computer Science · Computer Science 2023-10-06 Eveline Lehmann , Thomas Studer

We propose a new paradigm for Belief Change in which the new information is represented as sets of models, while the agent's body of knowledge is represented as a finite set of formulae, that is, a finite base. The focus on finiteness is…

Logic in Computer Science · Computer Science 2023-09-13 Ricardo Guimarães , Ana Ozaki , Jandson S. Ribeiro

We propose a dynamic logic of lying, wherein a 'lie that phi' (where phi is a formula in the logic) is an action in the sense of dynamic modal logic, that is interpreted as a state transformer relative to the formula phi. The states that…

Artificial Intelligence · Computer Science 2012-03-22 Hans van Ditmarsch

In this paper, we provide more evidence for the contention that logical consequence should be understood in normative terms. Hartry Field and John MacFarlane covered the classical case. We extend their work, examining what it means for an…

Logic in Computer Science · Computer Science 2014-02-20 Julio Lemos

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We report our findings on the properties of Flagg and Friedman's translation from Epistemic into Intuitionistic logic, which was proposed as the basis of a comprehensive proof method for the faithfulness of the Goodel translation. We focus…

Logic in Computer Science · Computer Science 2015-11-24 Alessandro Provetti , Andrea Zucchellini

This paper presents and discusses several methods for reasoning from inconsistent knowledge bases. A so-called argumentative-consequence relation taking into account the existence of consistent arguments in favor of a conclusion and the…

Artificial Intelligence · Computer Science 2013-03-08 Salem Benferhat , Didier Dubois , Henri Prade

Faroldi argues that deontic modals are hyperintensional and thus traditional modal logic cannot provide an appropriate formalization of deontic situations. To overcome this issue, we introduce novel justification logics as hyperintensional…

Logic in Computer Science · Computer Science 2023-08-14 Atefeh Rohani , Thomas Studer
‹ Prev 1 4 5 6 7 8 10 Next ›