First-order friendliness
The notion of logical friendliness was introduced by the second author [in: Logica universalis. Towards a general theory of logic. Basel: Birkhäuser. 195--224 (2007; Zbl 1143.03324)] into propositional language. \(\Gamma\) is said to be friendly to \(\phi\) iff for every classical valuation \(v\) on propositional variables occurring in a formulae of \(\Gamma\) holds, if \(v\models\Gamma\), then \(v^\prime\models\phi\) for some extension \(v^\prime\) of \(v\) to cover any remaining variables in \(\phi\). The authors extend this definition on the first-order language and obtain a new consequence relation accompanied by new properties. For example, compactness, interpolation and axiomatizability fail, in classical predicate logic, where the degree of deviations depends on the presence of equality with its standard interpretation.
- An introduction to recursively saturated and resplendent models
- Equality-free logic: the method of diagrams and preservation theorems
- scientific article; zbMATH DE number 5917718 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 3561334 (Why is no real title available?)
- scientific article; zbMATH DE number 3365239 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Interpolation and definability in abstract logics
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- MAXIMALITY OF LOGIC WITHOUT IDENTITY
- On Extensions of Elementary Logic
- Sentences with finite models
- Solvable cases of the decision problem
- What is \dots a resplendent structure?
This page was built for publication: First-order friendliness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030535)
