Zobrazeno 1 - 10
of 20 289
pro vyhledávání: '"Completeness theorem"'
Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this paper is two
Externí odkaz:
http://arxiv.org/abs/2405.09275
Autor:
Aguilera, Juan P.1,2 (AUTHOR) aguilera@logic.at
Publikováno v:
Archive for Mathematical Logic. Jul2023, Vol. 62 Issue 5/6, p751-788. 38p.
Autor:
Herbelin, Hugo, Ilik, Danko
G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a few standa
Externí odkaz:
http://arxiv.org/abs/2401.13304
Autor:
Statman, Richard, Dowek, Gilles
We give a complete self-contained proof of Statman's finite completeness theorem and of a corollary of this theorem stating that the $\lambda$-definability conjecture implies the higher-order matching conjecture.
Externí odkaz:
http://arxiv.org/abs/2309.03602
Autor:
Różowski, Wojciech, Silva, Alexandra
We introduce Probabilistic Regular Expressions (PRE), a probabilistic analogue of regular expressions denoting probabilistic languages in which every word is assigned a probability of being generated. We present and prove the completeness of an infer
Externí odkaz:
http://arxiv.org/abs/2310.08779
Autor:
Olszewski, Adam1 adam.olszewski@upjp2.edu.pl
Publikováno v:
Bulletin of the Section of Logic. Sep2024, Vol. 53 Issue 3, p365-397. 33p.
Autor:
Tumanov, S. N.1 (AUTHOR) sntumanov@yandex.ru
Publikováno v:
Mathematical Notes. May2021, Vol. 109 Issue 5/6, p836-839. 4p.
Autor:
ESPINDOLA, CHRISTIAN
Publikováno v:
The Journal of Symbolic Logic, 2020 Sep 01. 85(3), 1147-1162.
Externí odkaz:
https://www.jstor.org/stable/27030850
Autor:
Abel, Andreas
This document provides a formal proof of Birkhoff's completeness theorem for multi-sorted algebras which states that any equational entailment valid in all models is also provable in the equational theory. More precisely, if a certain equation is val
Externí odkaz:
http://arxiv.org/abs/2111.07936
Autor:
Jenkins, Hugo
Considering classical first-order logic with equality, we give a "fully syntactic" construction of the (weak) syntactic category $\text{Syn}(T)$ associated to a consistent theory $T$; we show it is a consistent coherent category; and we show that a m
Externí odkaz:
http://arxiv.org/abs/2111.05998