Completeness Theorems for the Systems E of Entailment and EQ of Entailment with Quantification

DOI10.1002/malq.19600060709zbMath0095.00801OpenAlexW1987387783MaRDI QIDQ3272466

No author found.

Publication date: 1960

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19600060709

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (11)

A relevant logic of questions ⋮ The completeness of a predicate-functor logic ⋮ First degree entailments ⋮ Relevant Robinson's arithmetic ⋮ Sets as singularities in the intensional universe ⋮ Alternative semantics for quantified first degree relevant logic ⋮ Normalized natural deduction systems for some relevant logics I: The logic DW ⋮ Valuation semantics for first-order logics of evidence and truth ⋮ First-order logics of evidence and truth with constant and variable domains ⋮ A decision procedure for the system E (of entailment). I ⋮ Rules in relevant logic. II: Formula representation

This page was built for publication: Completeness Theorems for the Systems E of Entailment and EQ of Entailment with Quantification