Results 31 to 40 of about 779,559 (291)
Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic [PDF]
, 2000 Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Goedel logic based on the truth value set [0,1].
Baaz, Matthias, Zach, Richard
core +4 more sources
Undecidable First-Order Theories of Affine Geometries [PDF]
Logical Methods in Computer Science, 2013 Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv.
Antti Kuusisto +2 more
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
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
A Sound and Complete Axiomatization of Majority-n Logic [PDF]
, 2015 Manipulating logic functions via majority operators recently drew the attention of researchers in computer science. For example, circuit optimization based on majority operators enables superior results as compared to traditional logic systems. Also, the
Amaru, Luca +3 more
core +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
Representation results for defeasible logic [PDF]
, 2000 The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism ...
Antoniou, G. +3 more
core +7 more sources