The following pages link to Thomas Studer (Q194999):
Displaying 50 items.
- Explicit mathematics: power types and overloading (Q556826) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Deep sequent systems for modal logic (Q834716) (← links)
- Logics of communication and change (Q859825) (← links)
- Temporal logics with incommensurable distances are undecidable (Q879597) (← links)
- Graph-based knowledge representation. Computational foundations of conceptual graphs (Q932109) (← links)
- Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
- Common knowledge does not have the Beth property (Q987837) (← links)
- On the proof theory of the modal mu-calculus (Q1005937) (← links)
- Syntactic cut-elimination for common knowledge (Q1024553) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- Justification logic with approximate conditional probabilities (Q1679821) (← links)
- A logic of blockchain updates (Q1709692) (← links)
- A Buchholz rule for modal fixed point logics (Q1942334) (← links)
- Logic and applications -- LAP meeting (Q2037987) (← links)
- Explicit non-normal modal logic (Q2148779) (← links)
- A logic of interactive proofs (Q2151405) (← links)
- Belief expansion in subset models (Q2177581) (← links)
- Public announcements for epistemic models and hypertheories (Q2284178) (← links)
- Bayesian confirmation and justifications (Q2297794) (← links)
- Probabilistic consensus of the blockchain protocol (Q2297801) (← links)
- Subset models for justification logic (Q2303608) (← links)
- A universal approach to guarantee data privacy (Q2392012) (← links)
- Realizing public announcements by justifications (Q2453578) (← links)
- Cut-free common knowledge (Q2475436) (← links)
- Deduction chains for common knowledge (Q2506830) (← links)
- A logic of knowing why (Q2693121) (← links)
- (Q2753685) (← links)
- A semantics for \(\lambda_{str}^{\{\,\}}\): A calculus with overloading and late-binding (Q2761748) (← links)
- Justifications for common knowledge (Q2901206) (← links)
- Partial Realization in Dynamic Justification Logic (Q3003345) (← links)
- Two Ways to Common Knowledge (Q3185764) (← links)
- The Proof Theory of Common Knowledge (Q3299587) (← links)
- A Formal Model of Data Privacy (Q3401963) (← links)
- Privacy Preserving Modules for Ontologies (Q3402291) (← links)
- Update as Evidence: Belief Expansion (Q3455850) (← links)
- Justified Terminological Reasoning (Q3457986) (← links)
- On contraction and the modal fragment (Q3520225) (← links)
- Data Privacy for $\mathcal{ALC}$ Knowledge Bases (Q3605544) (← links)
- (Q4436035) (← links)
- Justifying induction on modal -formulae (Q4644493) (← links)
- First steps towards probabilistic justification logic (Q4644527) (← links)
- Weak arithmetical interpretations for the Logic of Proofs (Q4644547) (← links)
- (Q4904077) (← links)
- Decidability for Justification Logics Revisited (Q4914518) (← links)
- Syntactic Cut-elimination for Common Knowledge (Q4982123) (← links)
- Semirings of Evidence (Q5019288) (← links)
- Justification Logics with Probability Operators (Q5024719) (← links)
- (Q5049154) (← links)
- A Conflict Tolerant Logic of Explicit Evidence (Q5059694) (← links)
