Decidability of all minimal models

DOI10.1007/3-540-61780-9_71zbMath1434.03056OpenAlexW1589628946MaRDI QIDQ4647581

Vincent Padovani

Publication date: 15 January 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61780-9_71

zbMATH Keywords

normal formminimal modelfree variableinduction hypothesispure form

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)

Related Items

Linear realizability and full completeness for typed lambda-calculi, Finitary PCF is not decidable, Unary PCF is decidable, Model-Checking Games for Typed λ-Calculi

Cites Work

• The lambda calculus, its syntax and semantics
• Third order matching is decidable
• Completeness, invariance and λ-definability
• Decidability of fourth-order matching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item