Results 21 to 30 of about 11,463 (263)
CLEI Electronic Journal, 2023 This work presents an interactive proof assistant, based on Dijkstra-Scholten logic, aimed at teaching logic and discrete mathematics in higher education.
Federico Flaviani, Walter Carballosa
doaj +1 more source
, 2022 We develop a classical propositional logic for reasoning about combinatory logic. We define its syntax, axiomatic system and semantics. The syntax and axiomatic system are presented based on classical propositional logic, with typed combinatory terms as basic propositions, along with the semantics based on applicative structures extended with special ...
Kašterović, Simona, Ghilezan, Silvia
openaire +2 more sources
A herbrandized functional interpretation of classical first-order logic [PDF]
, 2017 We introduce a new typed combinatory calculus with a type constructor that, to each type σ, associates the star type σ^∗ of the nonempty finite subsets of elements of type σ.
Ferreira, Fernando, Ferreira, Gilda
core +1 more source
Encoding the Factorisation Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Jay and Given-Wilson have recently introduced the Factorisation (or SF-) calculus as a minimal fundamental model of intensional computation. It is a combinatory calculus containing a special combinator, F, which is able to examine the internal structure ...
Reuben N. S. Rowe
doaj +1 more source
A Semantic Approach to Illative Combinatory Logic [PDF]
, 2011 This work introduces the theory of illative combinatory algebras, which is closely related to systems of illative combinatory logic. We thus provide a semantic interpretation for a formal framework in which both logic and computation may be expressed in
Czajka, Lukasz
core +1 more source
Revisiting the Duality of Computation: An Algebraic Analysis of Classical Realizability Models [PDF]
, 2020 International ...
core +4 more sources
Antecedentes griegos y medievales del cálculo lógico
Tópicos, 2013 Aristotle's sylogistics shows some precedents of the logical formalism as a deductive-axiomatic system that employs the notions of implication and validity, besides using variables for the terms.
Mauricio Beuchot P.
doaj +1 more source
RPO, Second-order Contexts, and Lambda-calculus [PDF]
Logical Methods in Computer Science, 2009 First, we extend Leifer-Milner RPO theory, by giving general conditions to obtain IPO labelled transition systems (and bisimilarities) with a reduced set of transitions, and possibly finitely branching.
Pietro Di Gianantonio +2 more
doaj +1 more source
Control Flow Analysis for SF Combinator Calculus [PDF]
, 2015 Programs that transform other programs often require access to the internal structure of the program to be transformed. This is at odds with the usual extensional view of functional programming, as embodied by the lambda calculus and SK combinator ...
Lester, Martin
core +7 more sources
Diversitas Journal, 2020 Mathematics in elementary school provides a whole foundation of knowledge that the student will need to expand more abstract contexts, establishing competencies and skills necessary to reason and think mathematically ...
Edel Guilherme Silva Pontes +5 more
doaj +1 more source