"Completeness and termination for a Seligman-style tableau system."

Patrick Blackburn et al. (2017)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/EXV052

access: closed

type: Journal Article

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/logcom/BlackburnBBJ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/BlackburnBBJ17
Patrick Blackburn, Thomas Bolander, Torben Braüner, Klaus Frovin Jørgensen:
Completeness and termination for a Seligman-style tableau system. J. Log. Comput. 27(1): 81-107 (2017)

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.