"Rules and Refutation Rules for the Logic of Finite n-ary Trees."

Tomasz F. Skura (2004)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/14.3.429

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/logcom/Skura04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/Skura04
Tomasz F. Skura:
Rules and Refutation Rules for the Logic of Finite n-ary Trees. J. Log. Comput. 14(3): 429-435 (2004)

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.