Results 11 to 20 of about 131,879,682 (302)
Computer Science, Logic, Informatics Education
J. Univers. Comput. Sci., 2006 JUCS - Journal of Universal Computer Science Volume Nr.
Varga,Katalin, Várterész,Magda
openaire +4 more sources
Learning objectives for courses in the Department of Computer Science, Oregon State University [PDF]
This document describes the overall learning objectives for courses in the department of computer science at Oregon State ...
Oregon State University. Department of Computer Science
core +6 more sources
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
Modal meet-implication logic [PDF]
Logical Methods in Computer Science, 2022 We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame.
Jim de Groot, Dirk Pattinson
doaj +1 more source
Theories of real addition with and without a predicate for integers [PDF]
Logical Methods in Computer Science, 2021 We show that it is decidable whether or not a relation on the reals definable in the structure $\langle \mathbb{R}, +,
Alexis Bès, Christian Choffrut
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
A modular construction of type theories [PDF]
Logical Methods in Computer Science, 2023 The lambda-Pi-calculus modulo theory is a logical framework in which many type systems can be expressed as theories. We present such a theory, the theory U, where proofs of several logical systems can be expressed. Moreover, we identify a sub-theory of U
Frédéric Blanqui +4 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
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