First-order friendliness

DOI10.1017/S175502032300014XMaRDI QIDQ7030535zbMATH OpenFDO

Authors Guillermo Badia, David Makinson

Publication date 7 February 2025

Published in The Review of Symbolic Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S175502032300014X

zbMATH Keywords

interpolationcompactnessconsequence relationaxiomatizabilityBeth propertyfriendliness

Mathematics Subject Classification ID

Classical first-order logic (03B10) Abstract deductive systems (03B22)

Cites work

• 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?)
• An introduction to recursively saturated and resplendent models
• Equality-free logic: the method of diagrams and preservation theorems
• 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)