In this study, several proofs of the compactness theorem for propositional logic with countably many atomic sentences are compared. Thereby some steps are taken towards a systematic philosophical study of the compactness theorem. In addition, some related data and morals for the theory of mathematical explanation are presented. © 2010 Taylor and Francis
There are shown some implications from pseudocompactness to compactness or sequential compactness. T...
It is well-known that theories of Bounded Arithmetic are closely related to propositional proof syst...
A weak concept of compactness for nonmonotonic logics is proposed, which is suitable for several non...
In this short article, I’ll exhibit a direct proof of the compactness theorem with-out making use of...
This work systematically studies the concept of compactness in classical propositional logic as well...
We document various notions of compactness, with some of their useful properties. Our main reference...
One of the classic theorems concerning the real numbers states that every open cover of a closed and...
AbstractLet Robinson's consistency theorem hold in logic L: then L will satisfy all the usual interp...
By the compactness property of a logic we mean that nite satisfiability implies satis ability for a ...
A condition, in two variants, is given such that if a property P satisfies this condition, then ever...
AbstractIn this note we study the relationship between [a, b]-compactness in the sense of open cover...
A first order structure M with universe M is atomic compact if every system of atomic formulas with ...
In this note we report on a project in progress, where we study compactness of infinitary logics, in...
We study the logical and computational properties of basic theorems of uncountable mathematics, in p...
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing...
There are shown some implications from pseudocompactness to compactness or sequential compactness. T...
It is well-known that theories of Bounded Arithmetic are closely related to propositional proof syst...
A weak concept of compactness for nonmonotonic logics is proposed, which is suitable for several non...
In this short article, I’ll exhibit a direct proof of the compactness theorem with-out making use of...
This work systematically studies the concept of compactness in classical propositional logic as well...
We document various notions of compactness, with some of their useful properties. Our main reference...
One of the classic theorems concerning the real numbers states that every open cover of a closed and...
AbstractLet Robinson's consistency theorem hold in logic L: then L will satisfy all the usual interp...
By the compactness property of a logic we mean that nite satisfiability implies satis ability for a ...
A condition, in two variants, is given such that if a property P satisfies this condition, then ever...
AbstractIn this note we study the relationship between [a, b]-compactness in the sense of open cover...
A first order structure M with universe M is atomic compact if every system of atomic formulas with ...
In this note we report on a project in progress, where we study compactness of infinitary logics, in...
We study the logical and computational properties of basic theorems of uncountable mathematics, in p...
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing...
There are shown some implications from pseudocompactness to compactness or sequential compactness. T...
It is well-known that theories of Bounded Arithmetic are closely related to propositional proof syst...
A weak concept of compactness for nonmonotonic logics is proposed, which is suitable for several non...
DOI
Add to ORKG