Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic

DOI10.1016/S0304-3975(02)00731-4zbMath1049.03006arXiv0905.0758MaRDI QIDQ1884882

Karim Nour, Christophe Raffalli

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.0758

zbMATH Keywords

completeness theoremsecond-order logic

Mathematics Subject Classification ID

Related Items (1)

Program verification with interacting analysis plugins

Cites Work

• Completeness and Hauptsatz for second order logic1
• The completeness of the first-order functional calculus
• Completeness in the theory of types
• Logic and structure.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic