"All finitely axiomatizable subframe logics containing the provability ..."

Frank Wolter (1998)

> Home

Details and statistics

DOI: 10.1007/S001530050090

access: closed

type: Journal Article

metadata version: 2023-12-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aml/Wolter98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aml/Wolter98
Frank Wolter:
All finitely axiomatizable subframe logics containing the provability logic CSM ₀_{0} are decidable. Arch. Math. Log. 37(3): 167-182 (1998)

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.