Conditional theories
From MaRDI portal
A variant of free logic with equality, called conditional logic, is introduced. The point is that every function symbol F of the formal language is supplied with a certain formula which defines the existence condition of the function corresponding to F. Furthermore, to every formula \(\psi\) a finite set of terms ``essential for \(\psi\) is associated. Syntax and semantics of conditional theories are developed, in some extent sufficient for proving a completeness theorem (in Henkin style).
Recommendations
Cites work
- A Language for Category Theory in which Natural Equivalence Implies Elementary Equivalence of Models
- scientific article; zbMATH DE number 3819805 (Why is no real title available?)
- scientific article; zbMATH DE number 3779578 (Why is no real title available?)
- scientific article; zbMATH DE number 3533138 (Why is no real title available?)
- scientific article; zbMATH DE number 3590249 (Why is no real title available?)
- scientific article; zbMATH DE number 3614202 (Why is no real title available?)
- Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
- Partial morphisms on partial algebras
- Théories egalitaires dans les langages sur types de graphes
Cited in
(2)
This page was built for publication: Conditional theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092039)
