Completeness theorems for some intermediate predicate calculi

DOI10.1007/BF01371631zbMath0571.03011OpenAlexW2086115452MaRDI QIDQ1061734

Pierluigi Minari

Publication date: 1983

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01371631

zbMATH Keywords

Kripke semanticsnegation-free intermediate predicate calculipositive predicate calculus

Mathematics Subject Classification ID

Intermediate logics (03B55) Categoricity and completeness of theories (03C35)

Related Items (2)

Ordered sets R and Q as bases of Kripke models ⋮ Algebraic structures in fuzzy logic

Cites Work

• A logic stronger than intuitionism
• Logic with truth values in A linearly ordered heyting algebra
• Ein Henkin-Beweis für die Vollständigkeit eines Kalküls relativ zur Grzegorczyk-Semantik
• Unnamed Item

This page was built for publication: Completeness theorems for some intermediate predicate calculi