Results 21 to 30 of about 67,082 (308)
Compact manifolds with computable boundaries [PDF]
Logical Methods in Computer Science, 2013 We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with computable ...
Zvonko Iljazovic
doaj +1 more source
The logical strength of B\"uchi's decidability theorem [PDF]
Logical Methods in Computer Science, 2019 We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$.
Leszek Kołodziejczyk +3 more
doaj +1 more source
On the algebraic structure of Weihrauch degrees [PDF]
Logical Methods in Computer Science, 2018 We introduce two new operations (compositional products and implication) on Weihrauch degrees, and investigate the overall algebraic structure. The validity of the various distributivity laws is studied and forms the basis for a comparison with similar ...
Vasco Brattka, Arno Pauly
doaj +1 more source
Tameness in least fixed-point logic and McColm's conjecture [PDF]
Logical Methods in Computer Science, 2021 We investigate four model-theoretic tameness properties in the context of least fixed-point logic over a family of finite structures. We find that each of these properties depends only on the elementary (i.e., first-order) limit theory, and we completely
Siddharth Bhaskar, Alex Kruckman
doaj +1 more source
About the range property for H [PDF]
Logical Methods in Computer Science, 2014 Recently, A. Polonsky has shown that the range property fails for H. We give here some conditions on a closed term that imply that its range has an infinite cardinality.
René David, Karim Nour
doaj +1 more source
Logical Methods in Computer Science, 2014 The Stone tautologies are known to have polynomial size resolution refutations and require exponential size regular refutations. We prove that the Stone tautologies also have polynomial size proofs in both pool resolution and the proof system of regular ...
Samuel R. Buss +1 more
doaj +1 more source
The extensional realizability model of continuous functionals and three weakly non-constructive classical theorems [PDF]
Logical Methods in Computer Science, 2015 We investigate wether three statements in analysis, that can be proved classically, are realizable in the realizability model of extensional continuous functionals induced by Kleene's second model $K_2$.
Dag Normann
doaj +1 more source
Representations of measurable sets in computable measure theory [PDF]
Logical Methods in Computer Science, 2014 This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly countably ...
Klaus Weihrauch +1 more
doaj +1 more source
On the Unusual Effectiveness of Logic in Computer Science [PDF]
Bulletin of Symbolic Logic, 2001 In 1960, E. P. Wigner, a joint winner of the 1963 Nobel Prize for Physics, published a paper titled On the Unreasonable Effectiveness of Mathematics in the Natural Sciences [61]. This paper can be construed as an examination and affirmation of Galileo's tenet that “The book of nature is written in the language of mathematics”.
Halpern, Joseph Y. +5 more
openaire +2 more sources
Admissibility in Finitely Generated Quasivarieties [PDF]
Logical Methods in Computer Science, 2013 Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore decidable ...
George Metcalfe +1 more
doaj +1 more source