Preliminaries to classical first-order model theory
From MaRDI portal
Publication:2865746
Recommendations
- Basic first-order model theory in Mizar
- Sequent calculus, derivability, provability. Gödel's completeness theorem
- Definition of first-order language with arbitrary alphabet. Syntax of terms, atomic formulas and their subterms
- First order languages: further syntax and semantics
- The Gödel completeness theorem for uncountable languages
Cites work
Cited in
(14)- First order languages: further syntax and semantics
- The Gödel completeness theorem for uncountable languages
- Sequent calculus, derivability, provability. Gödel's completeness theorem
- A guide to classical and modern model theory
- Custom automations in Mizar
- On rewriting rules in Mizar
- Basic first-order model theory in Mizar
- Prime representing polynomial with 10 unknowns -- introduction
- Euler's partition theorem
- Flexary operations
- Pseudo-canonical formulae are classical
- Definition of first-order language with arbitrary alphabet. Syntax of terms, atomic formulas and their subterms
- Free interpretation, quotient interpretation and substitution of a letter with a term for first-order languages
- scientific article; zbMATH DE number 1301853 (Why is no real title available?)
This page was built for publication: Preliminaries to classical first-order model theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865746)
