Results 31 to 40 of about 1,475 (68)
Computer theorem proving in math [PDF]
, 2004 We give an overview of issues surrounding computer-verified theorem proving in the standard pure-mathematical context. This is based on my talk at the PQR conference (Brussels, June 2003)
Carlos Simpson +1 more
core +4 more sources
The expressive power of modal logic with inclusion atoms [PDF]
, 2015 Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the
Hella, Lauri, Stumpf, Johanna
core +2 more sources
An Application Specific Informal Logic for Interest Prohibition Theory [PDF]
, 2011 Interest prohibition theory concerns theoretical aspects of interest prohibition. We attempt to lay down some aspects of interest prohibition theory wrapped in a larger framework of informal logic.
Bergstra, J. A., Middelburg, C. A.
core +1 more source
Property Checking Without Invariant Generation
, 2020 We introduce a procedure for proving safety properties. This procedure is based on a technique called Partial Quantifier Elimination (PQE). In contrast to complete quantifier elimination, in PQE, only a part of the formula is taken out of the scope of ...
Goldberg, Eugene
core
Isabelle/PIDE as Platform for Educational Tools
, 2012 The Isabelle/PIDE platform addresses the question whether proof assistants of the LCF family are suitable as technological basis for educational tools.
Amine Chaieb +29 more
core +2 more sources
Interest prohibition and financial product innovation [PDF]
, 2011 We give a rough sketch of the Judaic, Greek, Islamic and Christian positions in the matter of interest prohibition during the last few millennia and discuss the way in which interest prohibition is dealt with in Islamic finance, the problems with ...
Bergstra, J. A., Middelburg, C. A.
core +1 more source
On the definition of a theoretical concept of an operating system [PDF]
, 2010 We dwell on how a definition of a theoretical concept of an operating system, suitable to be incorporated in a mathematical theory of operating systems, could look like.
Bergstra, J. A., Middelburg, C. A.
core +1 more source
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems [PDF]
, 2006 We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of
A. Arnold +25 more
core +2 more sources
A progression ring for interfaces of instruction sequences, threads, and services [PDF]
, 2009 We define focus-method interfaces and some connections between such interfaces and instruction sequences, giving rise to instruction sequence components. We provide a flexible and practical notation for interfaces using an abstract datatype specification
Bergstra, Jan A., Ponse, Alban
core +1 more source
A feasible algorithm for typing in Elementary Affine Logic
, 2004 We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction.
A. Asperti +10 more
core +4 more sources