"Synthetic completeness proofs for Seligman-style tableau systems."

Klaus Frovin Jørgensen et al. (2016)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ aiml.net (open access)
- export record
  dblp key:
  - conf/aiml/JorgensenBBB16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiml/JorgensenBBB16
Klaus Frovin Jørgensen, Patrick Blackburn, Thomas Bolander, Torben Braüner:
Synthetic completeness proofs for Seligman-style tableau systems. Advances in Modal Logic 2016: 302-321

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.