"On the Decidability of Propositional Algorithmic Logic."

Bogdan S. Chlebus (1982)

> Home

Details and statistics

DOI: 10.1002/MALQ.19820281409

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mlq/Chlebus82a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mlq/Chlebus82a
Bogdan S. Chlebus:
On the Decidability of Propositional Algorithmic Logic. Math. Log. Q. 28(14-18): 247-261 (1982)

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.