The following pages link to Marco Bright Caminati (Q1945909):
Displayed 16 items.
- Item:Q1945909 (redirect page) (← links)
- Pseudo-canonical formulae are classical (Q502693) (← links)
- Custom automations in Mizar (Q1945910) (← links)
- A verified algorithm enumerating event structures (Q2364684) (← links)
- A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory (Q2843015) (← links)
- Preliminaries to Classical First Order Model Theory (Q2865746) (← links)
- Definition of First Order Language with Arbitrary Alphabet. Syntax of Terms, Atomic Formulas and their Subterms (Q2865747) (← links)
- First Order Languages: Further Syntax and Semantics (Q2865748) (← links)
- Free Interpretation, Quotient Interpretation and Substitution of a Letter with a Term for First Order Languages (Q2865749) (← links)
- Sequent Calculus, Derivability, Provability. Gödel's Completeness Theorem (Q2865750) (← links)
- (Q3075243) (← links)
- Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle? (Q5495927) (← links)
- Isabelle formalisation of original representation theorems (Q6118819) (← links)
- An upper bound on the number of zeros of a piecewise polinomial function (Q6211244) (← links)
- Yet another proof of Goedel's completeness theorem for first-order classical logic (Q6215837) (← links)
- A simplified framework for first-order languages and its formalization in Mizar (Q6233111) (← links)