Pages that link to "Item:Q2732527"
From MaRDI portal
The following pages link to Explicit Provability and Constructive Semantics (Q2732527):
Displaying 50 items.
- J-Calc: a typed lambda calculus for intuitionistic justification logic (Q276037) (← links)
- Intuitionistic hypothetical logic of proofs (Q276039) (← links)
- Modal logics, justification logics, and realization (Q286591) (← links)
- Labeled sequent calculus for justification logics (Q331048) (← links)
- Multi-agent justification logic: communication and evidence elimination (Q375307) (← links)
- Logical omniscience as infeasibility (Q392271) (← links)
- The logic of justified belief, explicit knowledge, and conclusive evidence (Q392273) (← links)
- Evidence and plausibility in neighborhood structures (Q392275) (← links)
- The paradox of the knower revisited (Q392283) (← links)
- Possible world semantics for first-order logic of proofs (Q392284) (← links)
- Fluctuations, effective learnability and metastability in analysis (Q392289) (← links)
- The logic of uncertain justifications (Q392291) (← links)
- Proof internalization in generalized Frege systems for classical logic (Q392294) (← links)
- Self-referentiality of Brouwer-Heyting-Kolmogorov semantics (Q392298) (← links)
- Conservativity for logics of justified belief: two approaches (Q408535) (← links)
- Tableaux and hypersequents for justification logics (Q408538) (← links)
- Lower complexity bounds in justification logic (Q408543) (← links)
- Prefixed tableaus and nested sequents (Q409323) (← links)
- A modal type theory for formalizing trusted communications (Q420842) (← links)
- Realization for justification logics via nested sequents: modularity through embedding (Q435202) (← links)
- The ontology of justifications in the logical setting (Q454364) (← links)
- On non-self-referential fragments of modal logics (Q508827) (← links)
- Practical extraction of evidence terms from common-knowledge reasoning (Q530856) (← links)
- On the representability of neatly embeddable CA's by cylindric relativized algebras (Q607464) (← links)
- From the knowability paradox to the existence of proofs (Q625705) (← links)
- Dynamic logics of knowledge and access (Q625719) (← links)
- Justification logics and hybrid logics (Q631081) (← links)
- Realizations and LP (Q636276) (← links)
- A modal provability logic of explicit and implicit proofs (Q636278) (← links)
- Reasoning about games (Q647418) (← links)
- The logic of proofs, semantically (Q703832) (← links)
- Propositional games with explicit strategies (Q731893) (← links)
- A logic of plausible justifications (Q744992) (← links)
- An epistemic logic for becoming informed (Q833038) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- Interacting explicit evidence systems (Q929292) (← links)
- Feasible operations on proofs: the logic of proofs for bounded arithmetic (Q929293) (← links)
- Intermediate logics and factors of the Medvedev lattice (Q952483) (← links)
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
- Self-referential justifications in epistemic logic (Q987374) (← links)
- Justification logics, logics of knowledge, and conservativity (Q1028642) (← links)
- Hypercomputation by definition (Q1434375) (← links)
- On arithmetical completeness of the logic of proofs (Q1625591) (← links)
- Reasoning about proof and knowledge (Q1625594) (← links)
- Prehistoric graph in modal derivations and self-referentiality (Q1678748) (← links)
- Paraconsistent logic, evidence, and justification (Q1685567) (← links)
- Constructive knowledge and the justified true belief paradigm (Q1688952) (← links)
- The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740) (← links)
- Event-based time-stamped claim logic (Q2043818) (← links)
- A reinterpretation of the semilattice semantics with applications (Q2045003) (← links)
