Switch to: References

Add citations

You must login to add citations.
  1. The logic of justification.Sergei Artemov - 2008 - Review of Symbolic Logic 1 (4):477-513.
    We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t: F that read t is a justification for F. Justification Logic absorbs basic principles originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the well-known Justified True Belief vs. Knowledge problem. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a (...)
    Download  
     
    Export citation  
     
    Bookmark   92 citations  
  • Shifting Priorities: Simple Representations for Twenty-seven Iterated Theory Change Operators.Hans Rott - 2009 - In Jacek Malinowski David Makinson & Wansing Heinrich, Towards Mathematical Philosophy. Springer. pp. 269–296.
    Prioritized bases, i.e., weakly ordered sets of sentences, have been used for specifying an agent’s ‘basic’ or ‘explicit’ beliefs, or alternatively for compactly encoding an agent’s belief state without the claim that the elements of a base are in any sense basic. This paper focuses on the second interpretation and shows how a shifting of priorities in prioritized bases can be used for a simple, constructive and intuitive way of representing a large variety of methods for the change of belief (...)
    Download  
     
    Export citation  
     
    Bookmark   78 citations  
  • Justification logic.Sergei Artemov - forthcoming - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • The Dynamics of Argumentative Discourse.Carlotta Pavese & Alexander W. Kocurek - 2021 - Journal of Philosophical Logic 51 (2):413-456.
    Arguments have always played a central role within logic and philosophy. But little attention has been paid to arguments as a distinctive kind of discourse, with its own semantics and pragmatics. The goal of this essay is to study the mechanisms by means of which we make arguments in discourse, starting from the semantics of argument connectives such as `therefore'. While some proposals have been made in the literature, they fail to account for the distinctive anaphoric behavior of `therefore', as (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Tracking reasons with extensions of relevant logics.Shawn Standefer - 2019 - Logic Journal of the IGPL 27 (4):543-569.
    In relevant logics, necessary truths need not imply each other. In justification logic, necessary truths need not all be justified by the same reason. There is an affinity to these two approaches that suggests their pairing will provide good logics for tracking reasons in a fine-grained way. In this paper, I will show how to extend relevant logics with some of the basic operators of justification logic in order to track justifications or reasons. I will define and study three kinds (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A logic of knowing why.Chao Xu, Yanjing Wang & Thomas Studer - 2021 - Synthese 198 (2):1259-1285.
    When we say “I know why he was late”, we know not only the fact that he was late, but also an explanation of this fact. We propose a logical framework of “knowing why” inspired by the existing formal studies on why-questions, scientific explanation, and justification logic. We introduce the Kyi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {K}}{}\textit{y}}_i$$\end{document} operator into the language of epistemic logic to express “agent i knows why φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Hyperintensional logics for everyone.Igor Sedlár - 2019 - Synthese 198 (2):933-956.
    We introduce a general representation of unary hyperintensional modalities and study various hyperintensional modal logics based on the representation. It is shown that the major approaches to hyperintensionality known from the literature, that is state-based, syntactic and structuralist approaches, all correspond to special cases of the general framework. Completeness results pertaining to our hyperintensional modal logics are established.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Prefixed tableaus and nested sequents.Melvin Fitting - 2012 - Annals of Pure and Applied Logic 163 (3):291 - 313.
    Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibility in a purely syntactic way. We show that modal nested sequents and prefixed modal tableaus are notational variants (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • A hyperintensional logical framework for deontic reasons.Federico L. G. Faroldi & Tudor Protopopescu - 2019 - Logic Journal of the IGPL 27 (4):411-433.
    In this paper we argue that normative reasons are hyperintensional and put forward a formal account of this thesis. That reasons are hyperintensional means that a reason for a proposition does not imply that it is also a reason for a logically equivalent proposition. In the first part we consider three arguments for the hyperintensionality of reasons: an argument from the nature of reasons, an argument from substitutivity and an argument from explanatory power. In the second part we describe a (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Getting some (non-classical) closure with justification logic.Shawn Standefer, Ted Shear & Rohan French - 2023 - Asian Journal of Philosophy 2 (2):1-25.
    Justification logics provide frameworks for studying the fine structure of evidence and justification. Traditionally, these logics do not impose any closure requirements on justification. In this paper, we argue that for some applications they should subject justification to closure under some variety of logical consequence. Specifically, we argue, building on ideas from Beall, that the non-classical logic FDE offers a particularly attractive notion of consequence for this purpose and define a justification logic where justification is closed under FDE consequence. We (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The logic of justified belief, explicit knowledge, and conclusive evidence.Alexandru Baltag, Bryan Renne & Sonja Smets - 2014 - Annals of Pure and Applied Logic 165 (1):49-81.
    We present a complete, decidable logic for reasoning about a notion of completely trustworthy evidence and its relations to justifiable belief and knowledge, as well as to their explicit justifications. This logic makes use of a number of evidence-related notions such as availability, admissibility, and “goodness” of a piece of evidence, and is based on an innovative modification of the Fitting semantics for Artemovʼs Justification Logic designed to preempt Gettier-type counterexamples. We combine this with ideas from belief revision and awareness (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Evidence and plausibility in neighborhood structures.Johan van Benthem, David Fernández-Duque & Eric Pacuit - 2014 - Annals of Pure and Applied Logic 165 (1):106-133.
    The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an evidence logic for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N. Further notions of relative plausibility between worlds and beliefs based on the latter ordering are then defined in terms of this (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Modal logics, justification logics, and realization.Melvin Fitting - 2016 - Annals of Pure and Applied Logic 167 (8):615-648.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Substructural epistemic logics.Igor Sedlár - 2015 - Journal of Applied Non-Classical Logics 25 (3):256-285.
    The article introduces substructural epistemic logics of belief supported by evidence. The logics combine normal modal epistemic logics with distributive substructural logics. Pieces of evidence are represented by points in substructural models and availability of evidence is modelled by a function on the point set. The main technical result is a general completeness theorem. Axiomatisations are provided by means of two-sorted Hilbert-style calculi. It is also shown that the framework presents a natural solution to the problem of logical omniscience.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • The Ontology of Justifications in the Logical Setting.Sergei N. Artemov - 2012 - Studia Logica 100 (1-2):17-30.
    Justification Logic provides an axiomatic description of justifications and delegates the question of their nature to semantics. In this note, we address the conceptual issue of the logical type of justifications: we argue that justifications in the logical setting are naturally interpreted as sets of formulas which leads to a class of epistemic models that we call modular models . We show that Fitting models for Justification Logic naturally encode modular models and can be regarded as convenient pre-models of the (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Intensional logic.Melvin Fitting - 2008 - Stanford Encyclopedia of Philosophy.
    There is an obvious difference between what a term designates and what it means. At least it is obvious that there is a difference. In some way, meaning determines designation, but is not synonymous with it. After all, “the morning star” and “the evening star” both designate the planet Venus, but don't have the same meaning. Intensional logic attempts to study both designation and meaning and investigate the relationships between them.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • A Logic of Justification and Truthmaking.Alessandro Giordani - 2013 - Review of Symbolic Logic 6 (2):323-342.
    In the present paper we propose a system of propositional logic for reasoning about justification, truthmaking, and the connection between justifiers and truthmakers. The logic of justification and truthmaking is developed according to the fundamental ideas introduced by Artemov. Justifiers and truthmakers are treated in a similar way, exploiting the intuition that justifiers provide epistemic grounds for propositions to be considered true, while truthmakers provide ontological grounds for propositions to be true. This system of logic is then applied both for (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Justifications for common knowledge.Samuel Bucheli, Roman Kuznets & Thomas Studer - 2011 - Journal of Applied Non-Classical Logics 21 (1):35-60.
    Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • A quantified logic of evidence.Melvin Fitting - 2008 - Annals of Pure and Applied Logic 152 (1):67-83.
    A propositional logic of explicit proofs, LP, was introduced in [S. Artemov, Explicit provability and constructive semantics, The Bulletin for Symbolic Logic 7 1–36], completing a project begun long ago by Gödel, [K. Gödel, Vortrag bei Zilsel, translated as Lecture at Zilsel’s in: S. Feferman , Kurt Gödel Collected Works III, 1938, pp. 62–113]. In fact, LP can be looked at in a more general way, as a logic of explicit evidence, and there have been several papers along these lines. (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • From the Knowability Paradox to the existence of proofs.W. Dean & H. Kurokawa - 2010 - Synthese 176 (2):177 - 225.
    The Knowability Paradox purports to show that the controversial but not patently absurd hypothesis that all truths are knowable entails the implausible conclusion that all truths are known. The notoriety of this argument owes to the negative light it appears to cast on the view that there can be no verification-transcendent truths. We argue that it is overly simplistic to formalize the views of contemporary verificationists like Dummett, Prawitz or Martin-Löf using the sort of propositional modal operators which are employed (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Discovering knowability: a semantic analysis.Sergei Artemov & Tudor Protopopescu - 2013 - Synthese 190 (16):3349-3376.
    In this paper, we provide a semantic analysis of the well-known knowability paradox stemming from the Church–Fitch observation that the meaningful knowability principle /all truths are knowable/, when expressed as a bi-modal principle F --> K♢F, yields an unacceptable omniscience property /all truths are known/. We offer an alternative semantic proof of this fact independent of the Church–Fitch argument. This shows that the knowability paradox is not intrinsically related to the Church–Fitch proof, nor to the Moore sentence upon which it (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • First steps towards probabilistic justification logic.Ioannis Kokkinis, Petar Maksimović, Zoran Ognjanović & Thomas Studer - 2015 - Logic Journal of the IGPL 23 (4):662-687.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Pavelka-style fuzzy justification logics.Meghdad Ghari - 2016 - Logic Journal of the IGPL 24 (5):743-773.
    Justification logics provide a framework for reasoning about justifications and evidence. In this article, we study a fuzzy variant of justification logics in which an agent’s justification for a belief has certainty degree between 0 and 1. We replace the classical base of justification logics with Hájek’s rational Pavelka logic. We introduce fuzzy possible world semantics with crisp accessibility relation and also single world models for our logics. We establish soundness and graded-style completeness for both kinds of semantics. We also (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Possible world semantics for first-order logic of proofs.Melvin Fitting - 2014 - Annals of Pure and Applied Logic 165 (1):225-240.
    In the tech report Artemov and Yavorskaya [4] an elegant formulation of the first-order logic of proofs was given, FOLP. This logic plays a fundamental role in providing an arithmetic semantics for first-order intuitionistic logic, as was shown. In particular, the tech report proved an arithmetic completeness theorem, and a realization theorem for FOLP. In this paper we provide a possible-world semantics for FOLP, based on the propositional semantics of Fitting [5]. We also give an Mkrtychev semantics. Motivation and intuition (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The Logic of Uncertain Justifications.Robert S. Milnikel - 2014 - Annals of Pure and Applied Logic 165 (1):305-315.
    In Artemovʼs Justification Logic, one can make statements interpreted as “t is evidence for the truth of formula F.” We propose a variant of this logic in which one can say “I have degree r of confidence that t is evidence for the truth of formula F.” After defining both an axiomatic approach and a semantics for this Logic of Uncertain Justifications, we will prove the usual soundness and completeness theorems.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Realization for justification logics via nested sequents: Modularity through embedding.Remo Goetschi & Roman Kuznets - 2012 - Annals of Pure and Applied Logic 163 (9):1271-1298.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Everyone Knows That Someone Knows: Quantifiers Over Epistemic Agents.Pavel Naumov & Jia Tao - 2019 - Review of Symbolic Logic 12 (2):255-270.
    Modal logic S5 is commonly viewed as an epistemic logic that captures the most basic properties of knowledge. Kripke proved a completeness theorem for the first-order modal logic S5 with respect to a possible worlds semantics. A multiagent version of the propositional S5 as well as a version of the propositional S5 that describes properties of distributed knowledge in multiagent systems has also been previously studied. This article proposes a version of S5-like epistemic logic of distributed knowledge with quantifiers ranging (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Gödel justification logics and realization.Nicholas Pischke - 2022 - Logic Journal of the IGPL 30 (3):343-408.
    We study the topic of realization from classical justification logics in the context of the recently introduced Gödel justification logics. We show that the standard Gödel modal logics of Caicedo and Rodriguez are not realized by the Gödel justification logics and moreover, we study possible extensions of the Gödel justification logics, which are strong enough to realize the standard Gödel modal logics. On the other hand, we study the fragments of the standard Gödel modal logics, which are realized by the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • From Display to Labelled Proofs for Tense Logics.Agata Ciabattoni, Tim Lyon & Revantha Ramanayake - 2013 - In Sergei Artemov & Anil Nerode, Logical Foundations of Computer Science (Lecture Notes in Computer Science 7734). Springer. pp. 120 - 139.
    We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Realizations and LP.Melvin Fitting - 2010 - Annals of Pure and Applied Logic 161 (3):368-387.
    LP can be seen as a logic of knowledge with justifications. See [S. Artemov, The logic of justification, The Review of Symbolic Logic 1 477–513] for a recent comprehensive survey of justification logics generally. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikka-style logic of knowledge S4, in which they are not explicitly present. Justifications, however, are far from unique. There are many ways of realizing each theorem of S4 in the logic LP. If (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A Note on Strong Axiomatization of Gödel Justification Logic.Nicholas Pischke - 2020 - Studia Logica 108 (4):687-724.
    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 : ”, indexed over t by a corresponding set of justification terms, which thus explicitly encode the justification for the necessity assertion in the syntax. With these operators, one can therefore not only reason about modal effects on propositions but also about dynamics inside the justifications themselves. We (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Decidability for some justification logics with negative introspection.Thomas Studer - 2013 - Journal of Symbolic Logic 78 (2):388-402.
    Justification logics are modal logics that include justifications for the agent's knowledge. So far, there are no decidability results available for justification logics with negative introspection. In this paper, we develop a novel model construction for such logics and show that justification logics with negative introspection are decidable for finite constant specifications.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A Substructural Approach to Explicit Modal Logic.Shawn Standefer - 2023 - Journal of Logic, Language and Information 32 (2):333–362.
    In this paper, we build on earlier work by Standefer (Logic J IGPL 27(4):543–569, 2019) in investigating extensions of substructural logics, particularly relevant logics, with the machinery of justification logics. We strengthen a negative result from the earlier work showing a limitation with the canonical model method of proving completeness. We then show how to enrich the language with an additional operator for implicit commitment to circumvent these problems. We then extend the logics with axioms for D, 4, and 5, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)A formalization of the Protagoras court paradox in a temporal logic of epistemic and normative reasons.Meghdad Ghari - 2023 - Artificial Intelligence and Law 31:1-43.
    We combine linear temporal logic (with both past and future modalities) with a deontic version of justification logic to provide a framework for reasoning about time and epistemic and normative reasons. In addition to temporal modalities, the resulting logic contains two kinds of justification assertions: epistemic justification assertions and deontic justification assertions. The former presents justification for the agent’s knowledge and the latter gives reasons for why a proposition is obligatory. We present two kinds of semantics for the logic: one (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • How to construct Remainder Sets for Paraconsistent Revisions: Preliminary Report.Rafael Testa, Eduardo Fermé, Marco Garapa & Maurício Reis - 2018 - 17th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING.
    Revision operation is the consistent expansion of a theory by a new belief-representing sentence. We consider that in a paraconsistent setting this desideratum can be accomplished in at least three distinct ways: the output of a revision operation should be either non-trivial or non-contradictory (in general or relative to the new belief). In this paper those distinctions will be explored in the constructive level by showing how the remainder sets could be refined, capturing the key concepts of paraconsistency in a (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A logic of explicit knowledge.Melvin Fitting - unknown
    A well-known problem with Hintikka-style logics of knowledge is that of logical omniscience. One knows too much. This breaks down into two subproblems: one knows all tautologies, and one’s knowledge is closed under consequence. A way of addressing the second of these is to move from knowledge simpliciter, to knowledge for a reason. Then, as consequences become ‘further away’ from one’s basic knowledge, reasons for them become more complex, thus providing a kind of resource measurement. One kind of reason is (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Labeled sequent calculus for justification logics.Meghdad Ghari - 2017 - Annals of Pure and Applied Logic 168 (1):72-111.
    Justification logics are modal-like logics that provide a framework for reasoning about justifications. This paper introduces labeled sequent calculi for justification logics, as well as for combined modal-justification logics. Using a method due to Sara Negri, we internalize the Kripke-style semantics of justification and modal-justification logics, known as Fitting models, within the syntax of the sequent calculus to produce labeled sequent calculi. We show that all rules of these systems are invertible and the structural rules (weakening and contraction) and the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A New Semantics for Systems of Logic of Essence.Alessandro Giordani - 2014 - Studia Logica 102 (3):411-440.
    The purpose of the present paper is to provide a way of understanding systems of logic of essence by introducing a new semantic framework for them. Three central results are achieved: first, the now standard Fitting semantics for the propositional logic of evidence is adapted in order to provide a new, simplified semantics for the propositional logic of essence; secondly, we show how it is possible to construe the concept of necessary truth explicitly by using the concept of essential truth; (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Derivability in certain subsystems of the Logic of Proofs is-complete.Robert Milnikel - 2007 - Annals of Pure and Applied Logic 145 (3):223-239.
    The Logic of Proofs realizes the modalities from traditional modal logics with proof polynomials, so an expression □F becomes t:F where t is a proof polynomial representing a proof of or evidence for F. The pioneering work on explicating the modal logic is due to S. Artemov and was extended to several subsystems by V. Brezhnev. In 2000, R. Kuznets presented a algorithm for deducibility in these logics; in the present paper we will show that the deducibility problem is -complete. (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Justification Logic with Confidence.Ted Shear & John Quiggin - 2020 - Studia Logica 108 (4):751-778.
    Justification logics are a family of modal logics whose non-normal modalities are parametrised by a type-theoretic calculus of terms. The first justification logic was developed by Sergei Artemov to provide an explicit modal logic for arithmetical provability in which these terms were taken to pick out proofs. But, justification logics have been given various other interpretations as well. In this paper, we will rely on an interpretation in which the modality \ is read ‘S accepts \ as justification for \’. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Basic Intuitionistic Logic of Proofs.Sergei Artemov & Rosalie Iemhoff - 2007 - Journal of Symbolic Logic 72 (2):439 - 451.
    The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A new framework for justification logic.Alessandro Giordani - 2015 - Journal of Applied Non-Classical Logics 25 (4):308-323.
    The logic of justification provides an in-depth analysis of the epistemic states of an agent. This paper aims at solving some of the problems to which the common interpretation of the operators of justification logic is subject by providing a framework in which a crucial distinction between potential and explicit justifiers is exploited. The paper is subdivided into three sections. The first section offers an introduction to a basic system LJ of justification logic and to the problems concerning its interpretation. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An epistemic logic for becoming informed.Giuseppe Primiero - 2009 - Synthese 167 (2):363 - 389.
    Various conceptual approaches to the notion of information can currently be traced in the literature in logic and formal epistemology. A main issue of disagreement is the attribution of truthfulness to informational data, the so called Veridicality Thesis (Floridi 2005). The notion of Epistemic Constructive Information (Primiero 2007) is one of those rejecting VT. The present paper develops a formal framework for ECI. It extends on the basic approach of Artemov’s logic of proofs (Artemov 1994), representing an epistemic logic based (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Causal interpretation of Gödel's ontological proof.Srećko Kovač - 2015 - In Kordula Świętorzecka, Gödel's Ontological Argument: History, Modifications, and Controversies. Semper. pp. 163.201.
    Gödel's ontological argument is related to Gödel's view that causality is the fundamental concept in philosophy. This explicit philosophical intention is developed in the form of an onto-theological Gödelian system based on justification logic. An essentially richer language, so extended, offers the possibility to express new philosophical content. In particular, theorems on the existence of a universal cause on a causal "slingshot" are formulated.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Justification logic.Melvin Fitting - manuscript
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the importance of being analytic. The paradigmatic case of the logic of proofs.Francesca Poggiolesi - 2012 - Logique Et Analyse 55 (219):443-461.
    In the recent literature on proof theory, there seems to be a new raising topic which consists in identifying those properties that characterise a good sequent calculus. The property that has received by far the most attention is the analyticity property. In this paper we propose a new argument in support of the analyticity property. We will do it by means of the example of the logic of proofs, a logic recently introduced by Artemov [1]. Indeed a detailed proof analysis (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A Computational Learning Semantics for Inductive Empirical Knowledge.Kevin T. Kelly - 2014 - In Alexandru Baltag & Sonja Smets, Johan van Benthem on Logic and Information Dynamics. Cham, Switzerland: Springer International Publishing. pp. 289-337.
    This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Compatibilist Approach in Ontology: Steps Towards a Formalization.Massimiliano Carrara & Vittorio Morato - 1998 - In Nicola Guarino, Formal Ontology in Information Systems. IOS Press. pp. 182-194.
    Commonsense ontology often conflicts with the ontology of our best scientific and philosophical theories. However, commonsense ontology, and commonsense belief systems in general, seems to be remarkably efficient and cognitively fundamental. In cases of contrast, it is better to find a way to reconcile commonsense and ”theoretical” ontologies. Given that commonsense ontologies are typically expressed within natural language, a classical procedure of reconciliation is semantical. The strategy is that of individuating the ”ontologically problematic” expressions of natural language and paraphrasing the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Justification logics and hybrid logics.Melvin Fitting - 2010 - Journal of Applied Logic 8 (4):356-370.
    Hybrid logics internalize their own semantics. Members of the newer family of justification logics internalize their own proof methodology. It is an appealing goal to combine these two ideas into a single system, and in this paper we make a start. We present a hybrid/justification version of the modal logic T. We give a semantics, a proof theory, and prove a completeness theorem. In addition, we prove a Realization Theorem, something that plays a central role for justification logics generally. Since (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Remarks on the origin and foundations of formalisation.Srećko Kovač - 2020 - In Marcin Będkowski, Anna Brożek, Alicja Chybińska, Stepan Ivanyk & Dominik Traczykowski, Formal and Informal Methods in Philosophy. Boston: Brill | Rodopi. pp. 163-179..
    The Aristotelian origins of formal systems are outlined, together with Aristotle's use of causal terms in describing syllogisms. The precision and exactness of a formalism, based on the projection of logical forms into perceptive signs, is contrasted with foundational, abstract concepts, independent of any formalism, which are presupposed for the understanding of a formal language. The definition of a formal system by means of a Turing machine is put in the context of Wittgenstein's general considerations of a machine understood as (...)
    Download  
     
    Export citation  
     
    Bookmark