Buscar
Mostrando ítems 51-60 de 4500
On the distinction between Formal Logic and Transcendental Logic in Cassirer and Natorp
(2016)
The paper compares the distinction between formal and transcendental logic as it is presented by Kant in the CPR, with the understanding of the same distinction by the Marburg’s School, especially Cassirer (1907) and Natorp ...
SteelCore: An extensible concurrent separation logic for effectful dependently typed programs
(Association for Computing Machinery, 2020-08)
Much recent research has been devoted to modeling effects within type theory. Building on this work, we observe that effectful type theories can provide a foundation on which to build semantics for more complex programming ...
Intuitionistic Hypothetical Logic of Proof
(Elsevier Science, 2013-10)
We study a term assignment for an intuitonistic fragment of the Logic of Proofs (LP). LP is a refinement of modal logic S4 in which the assertion ✷A is replaced by [[s]]A whose intended reading is “s is a proof of A”. We ...
Foundations of Software Science and Computation Structures : 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020, Proceedings
This open access book constitutes the proceedings of the 23rd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2020, which took place in Dublin, Ireland, in April 2020, and ...
Verification of Dynamic Bisimulation Theorems in Coq
(Elsevier, 2021-04)
Over the last years, the study of logics that can update a model while evaluating a formula has gained in interest. Motivated by many examples in practice such as hybrid logics, separation logics and dynamic epistemic ...
Visualização interativa para o ensino de programação lógica em Prolog
(Universidade Tecnológica Federal do ParanáGuarapuavaBrasilTecnologia em Sistemas para InternetUTFPR, 2013-12-04)
This research focuses on the difficulties faced by learners of languages based on logic programming paradigm, turning specifically to the Prolog language learning. From an introduction to Prolog are discussed concepts like ...
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
(Elsevier Science Inc, 2008-08)
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the ...