Preliminaries to classical first-order model theory
From MaRDI portal
Publication:2865746
DOI10.2478/V10037-011-0025-2zbMATH Open1276.03030OpenAlexW1974420731MaRDI QIDQ2865746FDOQ2865746
Authors: Marco Caminati 
Publication date: 3 December 2013
Published in: Formalized Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/v10037-011-0025-2
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
Mechanization of proofs and logical operations (03B35) Basic properties of first-order languages and structures (03C07)
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
- Title not available (Why is that?)
Uses Software
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)
