Sciweavers

23 search results - page 2 / 5
» japll 2006
Sort
View
JAPLL
2006
79views more  JAPLL 2006»
13 years 4 months ago
Innovations in computational type theory using Nuprl
For twenty years the Nuprl ("new pearl") system has been used to develop software systems and formal theories of computational mathematics. It has also been used to expl...
Stuart F. Allen, Mark Bickford, Robert L. Constabl...
JAPLL
2006
87views more  JAPLL 2006»
13 years 4 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk
JAPLL
2006
104views more  JAPLL 2006»
13 years 4 months ago
A proof-centric approach to mathematical assistants
We present an approach to mathematical assistants which uses readable, executable proof scripts as the central language for interaction. We examine an implementation that combines...
Lucas Dixon, Jacques D. Fleuriot
JAPLL
2010
133views more  JAPLL 2010»
13 years 3 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
JAPLL
2010
131views more  JAPLL 2010»
13 years 3 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...