Results 11 to 20 of about 150,676 (217)

DEVELOPING PROOF-BASED LEARNING USING APOS THEORY APPROACH IN EXPONENTIAL FOR ENHANCING STUDENTS’ REASONING ABILITY

open access: yesAksioma: Jurnal Program Studi Pendidikan Matematika, 2022
Proof-based learning is learning mathematics through proof and proving to strengthen students' concepts. The use of APOS theory (Action, Process, Object, and Schema) aims to describe students' mental structures summarized in Hypothetical Learning ...
Leonardo Jonathan Shinariko   +2 more
doaj   +1 more source

Proof Theory of a Multi-Lane Spatial Logic [PDF]

open access: yesLogical Methods in Computer Science, 2015
We extend the Multi-lane Spatial Logic MLSL, introduced in previous work for proving the safety (collision freedom) of traffic maneuvers on a multi-lane highway, by length measurement and dynamic modalities.
Sven Linker, Martin Hilscher
doaj   +1 more source

The RedPRL Proof Assistant (Invited Paper) [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
RedPRL is an experimental proof assistant based on Cartesian cubical computational type theory, a new type theory for higher-dimensional constructions inspired by homotopy type theory.
Carlo Angiuli   +4 more
doaj   +1 more source

Reduction Free Normalisation for a proof irrelevant type of propositions [PDF]

open access: yesLogical Methods in Computer Science, 2023
We show normalisation and decidability of convertibility for a type theory with a hierarchy of universes and a proof irrelevant type of propositions, close to the type system used in the proof assistant Lean.
Thierry Coquand
doaj   +1 more source

Intuitionistic Layered Graph Logic: Semantics and Proof Theory [PDF]

open access: yesLogical Methods in Computer Science, 2018
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature.
Simon Docherty, David Pym
doaj   +1 more source

A proof of strong normalisation using domain theory [PDF]

open access: yesLogical Methods in Computer Science, 2007
Ulrich Berger presented a powerful proof of strong normalisation using domains, in particular it simplifies significantly Tait's proof of strong normalisation of Spector's bar recursion.
Thierry Coquand, Arnaud Spiwack
doaj   +1 more source

Understanding Prescriptive Texts: Rules and Logic as Elaborated by the Mīmāṃsā School

open access: yesJournal of World Philosophies, 2017
The Mīmāṃsā school of Indian philosophy elaborated complex ways of interpreting the prescriptive portions of the Vedic sacred texts. The present article is the result of the collaboration of a group of scholars of logic, computer science, European ...
Elisa Freschi,   +3 more
doaj   +1 more source

Towards a Proof Theory of G\"odel Modal Logics [PDF]

open access: yesLogical Methods in Computer Science, 2011
Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of G\"odel logic.
George Metcalfe, Nicola Olivetti
doaj   +1 more source

A proof-theoretic approach to scope ambiguity in compositional vector space models

open access: yesJournal of Language Modelling, 2019
We investigate the extent to which compositional vector space models can be used to account for scope ambiguity in quantified sentences (of the form Every man loves some woman).
Gijs Wijnholds
doaj   +1 more source

A Proof Theory for Model Checking: An Extended Abstract [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2017
While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking.
Quentin Heath, Dale Miller
doaj   +1 more source

Home - About - Disclaimer - Privacy