Research output: Working paper › Preprint

Published

**Yet another proof of Goedel's completeness theorem for first-order classical logic.** / Caminati, Marco B.

Research output: Working paper › Preprint

Caminati, MB 2009 'Yet another proof of Goedel's completeness theorem for first-order classical logic' arXiv preprint arXiv:0910.2059. https://doi.org/10.48550/arXiv.0910.2059

Caminati, M. B. (2009). *Yet another proof of Goedel's completeness theorem for first-order classical logic*. (arXiv preprint arXiv:0910.2059). https://doi.org/10.48550/arXiv.0910.2059

Caminati MB. Yet another proof of Goedel's completeness theorem for first-order classical logic. 2009 Oct 11. (arXiv preprint arXiv:0910.2059). doi: 10.48550/arXiv.0910.2059

@techreport{5a4e7e15ecd34abe8355bfb111cd668e,

title = "Yet another proof of Goedel's completeness theorem for first-order classical logic",

abstract = "A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules, satisfiability theorem is seen to need weaker assumptions than completeness theorem, the missing request being exactly the rule ~ p --> p, which gives a hint of intuitionism's motivations from a classical point of view. A bare treatment of standard, basic first-order syntax somehow more algebraic-flavoured than usual is also given.",

author = "Caminati, {Marco B}",

year = "2009",

month = oct,

day = "11",

doi = "10.48550/arXiv.0910.2059",

language = "English",

series = "arXiv preprint arXiv:0910.2059",

type = "WorkingPaper",

}

TY - UNPB

T1 - Yet another proof of Goedel's completeness theorem for first-order classical logic

AU - Caminati, Marco B

PY - 2009/10/11

Y1 - 2009/10/11

N2 - A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules, satisfiability theorem is seen to need weaker assumptions than completeness theorem, the missing request being exactly the rule ~ p --> p, which gives a hint of intuitionism's motivations from a classical point of view. A bare treatment of standard, basic first-order syntax somehow more algebraic-flavoured than usual is also given.

AB - A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules, satisfiability theorem is seen to need weaker assumptions than completeness theorem, the missing request being exactly the rule ~ p --> p, which gives a hint of intuitionism's motivations from a classical point of view. A bare treatment of standard, basic first-order syntax somehow more algebraic-flavoured than usual is also given.

U2 - 10.48550/arXiv.0910.2059

DO - 10.48550/arXiv.0910.2059

M3 - Preprint

T3 - arXiv preprint arXiv:0910.2059

BT - Yet another proof of Goedel's completeness theorem for first-order classical logic

ER -