Sciweavers

67 search results - page 7 / 14
» A Proof Theory for Generic Judgments: An extended abstract
Sort
View
JSYML
2008
72views more  JSYML 2008»
13 years 6 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
MKM
2007
Springer
14 years 25 days ago
Context Aware Calculation and Deduction
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
Amine Chaieb, Makarius Wenzel
SLOGICA
2008
97views more  SLOGICA 2008»
13 years 6 months ago
A Generic Framework for Adaptive Vague Logics
A generic format for adaptive vague logics is presented. The concrete adaptive vague logics based on this format are able to (1) identify sentences as vague or non-vague in the con...
Peter Verdée, Stephan van der Waart van Gul...
SLP
1993
110views more  SLP 1993»
13 years 8 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
TPHOL
2009
IEEE
14 years 1 months ago
A Brief Overview of Agda - A Functional Language with Dependent Types
Abstract. We give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is based on Martin-L¨of’s intuitionistic t...
Ana Bove, Peter Dybjer, Ulf Norell