"The undecidability of proof search when equality is a logical connective."

Dale Miller, Alexandre Viel (2022)

> Home

Details and statistics

DOI: 10.1007/S10472-021-09764-0

access: closed

type: Journal Article

metadata version: 2022-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amai/MillerV22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/MillerV22
Dale Miller, Alexandre Viel:
The undecidability of proof search when equality is a logical connective. Ann. Math. Artif. Intell. 90(5): 523-535 (2022)

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.