Results 1 to 10 of about 53,090 (266)
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
Some observations on the logical foundations of inductive theorem proving [PDF]
Logical Methods in Computer Science, 2018 In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a goal. Based on
Stefan Hetzl, Tin Lok Wong
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
A Galois connection between Turing jumps and limits [PDF]
Logical Methods in Computer Science, 2018 Limit computable functions can be characterized by Turing jumps on the input side or limits on the output side. As a monad of this pair of adjoint operations we obtain a problem that characterizes the low functions and dually to this another problem that
Vasco Brattka
doaj +1 more source
A revised completeness result for the simply typed $\lambda\mu$-calculus using realizability semantics [PDF]
Logical Methods in Computer Science, 2017 In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability semantics using a
Karim Nour, Mohamad Ziadeh
doaj +1 more source
Logics in Computer Science [PDF]
, 2010 In this thesis, we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts.
openaire +2 more sources
Games and Strategies as Event Structures [PDF]
Logical Methods in Computer Science, 2017 In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the results of Rideau ...
Simon Castellan +3 more
doaj +1 more source
Logicism and the Development of Computer Science [PDF]
, 2002 This paper argues for the thesis that ideas originating in the philosophy of mathematics have proved very helpful for the development of computer science. In particular, logicism, the view that mathematics can be reduced to logic, was developed by Frege and Russell, long before computers were invented, and yet many of the ideas of logicism have been ...
openaire +3 more sources
Geometric Logic in Computer Science [PDF]
, 1993 We present an introduction to geometric logic and the mathematical structures associated with it, such as categorical logic and toposes. We also describe some of its applications in computer science including its potential as a logic for specification languages.
openaire +2 more sources