Explicit Provability and Constructive Semantics

From MaRDI portal
Publication:2732527

DOI10.2307/2687821zbMath0980.03059OpenAlexW2043468053MaRDI QIDQ2732527

Sergej N. Artemov

Publication date: 27 February 2002

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0701-toc.htm



Related Items

Possibilistic Justification Logic, On Aggregating Probabilistic Evidence, Probabilistic Justification Logic, An Arithmetical Interpretation of Verification and Intuitionistic Knowledge, The basic intuitionistic logic of proofs, Decidability for some justification logics with negative introspection, Intuitionistic Epistemology and Modal Logics of Verification, A Conflict Tolerant Logic of Explicit Evidence, Relating Semantics for Epistemic Logic, Semirings of Evidence, Substructural epistemic logics, A new framework for justification logic, A Logic of Knowledge and Belief Based on Abstract Arguments, Topological Semantics of Justification Logic, S4LP and Local Realizability, Self-referentiality of Justified Knowledge, On Boolean algebraic structure of proofs: towards an algebraic semantics for the logic of proofs, Conditional obligations in justification logic, Modal and justification logics for multi-agent systems (invited talk), Cardinality reduction theorem for logics QHC and QH4, Providing personalized explanations: a conversational approach, Justification Logic, 2007 Annual Meeting of the Association for Symbolic Logic, Propositional Games with Explicit Strategies, THE LOGIC OF JUSTIFICATION, INTUITIONISTIC EPISTEMIC LOGIC, Tracking Evidence, A LOGIC OF JUSTIFICATION AND TRUTHMAKING, Reasoning with Justifications, The Logic of Proofs as a Foundation for Certifying Mobile Computation, The NP-Completeness of Reflected Fragments of Justification Logics, Tableaux and Hypersequents for Justification Logic, Conservativity for Logics of Justified Belief, The single-conclusion proof logic and inference rules specification, Logic of proofs and provability, Symmetric Logic of Proofs, 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02, 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08, The Minimal System of Justification Logic with Names, Knowledge, Time, and Logical Omniscience, On Definitive Solutions of Strategic Games, Gödel and Intuitionism, On the Blok-Esakia Theorem, Justification Logics with Probability Operators, J-Calc: a typed lambda calculus for intuitionistic justification logic, Intuitionistic hypothetical logic of proofs, Modal logics, justification logics, and realization, On arithmetical completeness of the logic of proofs, Reasoning about proof and knowledge, An epistemic logic for becoming informed, The intuitionistic fragment of computability logic at the propositional level, Causal Logic Programming, Justifications for common knowledge, Simple Evidence Elimination in Justification Logic, Realization Theorems for Justification Logics: Full Modularity, Explicit Generic Common Knowledge, Update as Evidence: Belief Expansion, The Logic of Uncertain Justifications, Justifications, Awareness and Epistemic Dynamics, Temporalizing Modal Epistemic Logic, Self-referentiality in the Brouwer–Heyting–Kolmogorov Semantics of Intuitionistic Logic, Explicit non-normal modal logic, Two Ways to Common Knowledge, Justification logic and type theory as formalizations of intuitionistic propositional logic, A logic of interactive proofs, Labeled sequent calculus for justification logics, Mathematical logic: proof theory, constructive mathematics. Abstracts fro the workshop held November 6--12, 2011., NEXP-Completeness and Universal Hardness Results for Justification Logic, Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete, Causal Graph Justifications of Logic Programs, Multi-agent justification logic: communication and evidence elimination, On the representability of neatly embeddable CA's by cylindric relativized algebras, Prehistoric graph in modal derivations and self-referentiality, Logical omniscience as infeasibility, The logic of justified belief, explicit knowledge, and conclusive evidence, Evidence and plausibility in neighborhood structures, The paradox of the knower revisited, Possible world semantics for first-order logic of proofs, Fluctuations, effective learnability and metastability in analysis, The logic of uncertain justifications, Proof internalization in generalized Frege systems for classical logic, Self-referentiality of Brouwer-Heyting-Kolmogorov semantics, Paraconsistent logic, evidence, and justification, Constructive knowledge and the justified true belief paradigm, Conservativity for logics of justified belief: two approaches, Tableaux and hypersequents for justification logics, Lower complexity bounds in justification logic, Prefixed tableaus and nested sequents, A realization theorem for the Gödel-Löb provability logic, A note on strong axiomatization of Gödel justification logic, Justification logic with confidence, A proof theory for the logic of provability in true arithmetic, From the knowability paradox to the existence of proofs, Dynamic logics of knowledge and access, A modal type theory for formalizing trusted communications, Justification logics and hybrid logics, Introduction to computability logic, A logic of knowing why, Realizations and LP, A modal provability logic of explicit and implicit proofs, Realization for justification logics via nested sequents: modularity through embedding, The Logic of Justification, Reasoning about games, Discovering knowability: a semantic analysis, The ontology of justifications in the logical setting, Interacting explicit evidence systems, Feasible operations on proofs: the logic of proofs for bounded arithmetic, Montague's paradox, informal provability, and explicit modal logic, A complexity question in justification logic, Hypercomputation by definition, The Proof Theory of Common Knowledge, Kripke semantics for the logic of problems and propositions, Logic of proofs with substitution, On non-self-referential fragments of modal logics, Intermediate logics and factors of the Medvedev lattice, Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography, A quantified logic of evidence, Practical extraction of evidence terms from common-knowledge reasoning, Distributed knowledge justification logics, Hypothetical logic of proofs, The logic of proofs, semantically, Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics, Typing in reflective combinatory logic, Justified common knowledge, Making knowledge explicit: how hard it is, On the complexity of the reflected logic of proofs, Referential logic of proofs, Self-referential justifications in epistemic logic, Connectionist computations of intuitionistic reasoning, The complexity of satisfiability in non-iterated and iterated probabilistic logics, Propositional games with explicit strategies, 2004 Annual Meeting of the Association for Symbolic Logic, Event-based time-stamped claim logic, A reinterpretation of the semilattice semantics with applications, A logic of plausible justifications, A Curry–Howard View of Basic Justification Logic, Justification logics, logics of knowledge, and conservativity, Reasoning About Justified Belief Based on the Fusion of Evidence, Structured argumentation dynamics. Undermining attacks in default justification logic, 2005–06 Winter Meeting of the Association for Symbolic Logic, An analytic calculus for the intuitionistic logic of proofs, The sharpness property of justification logic, 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05, Non-circular proofs and proof realization in modal logic



Cites Work