<--- Back to Details
First PageDocument Content
Mathematics / Order theory / Algebra / Abstract algebra / Lattice theory / Mathematical logic / Algebraic structures / Predicate logic / Distributive lattice / Complete Heyting algebra / Mereology / Partially ordered set
Date: 2018-08-15 07:19:09
Mathematics
Order theory
Algebra
Abstract algebra
Lattice theory
Mathematical logic
Algebraic structures
Predicate logic
Distributive lattice
Complete Heyting algebra
Mereology
Partially ordered set

Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Add to Reading List

Source URL: isabelle.in.tum.de

Download Document from Source Website

File Size: 361,50 KB

Share Document on Facebook

Similar Documents

Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany  Abstract. In this paper, we present a predic

Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany Abstract. In this paper, we present a predic

DocID: 1xUQe - View Document

J. Korean Math. Soc.  FORMALIZING THE META-THEORY OF FIRST-ORDER PREDICATE LOGIC Hugo Herberlin, SunYoung Kim, and Gyesik Lee Abstract. This paper introduces a representation style of variable binding using dependent typ

J. Korean Math. Soc. FORMALIZING THE META-THEORY OF FIRST-ORDER PREDICATE LOGIC Hugo Herberlin, SunYoung Kim, and Gyesik Lee Abstract. This paper introduces a representation style of variable binding using dependent typ

DocID: 1v7hr - View Document

STRICT PREDICATIVITY1 Charles Parsons The most basic notion of impredicativity applies to specifications or definitions of sets or classes. If a set b is specified as {x: A(x)} for some predicate A, then the specificatio

STRICT PREDICATIVITY1 Charles Parsons The most basic notion of impredicativity applies to specifications or definitions of sets or classes. If a set b is specified as {x: A(x)} for some predicate A, then the specificatio

DocID: 1unjy - View Document

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

DocID: 1tDnH - View Document

Predicate Abstraction in a Program Logic Calculus Benjamin Weiß Institute for Theoretical Computer Science University of Karlsruhe, DKarlsruhe, Germany

Predicate Abstraction in a Program Logic Calculus Benjamin Weiß Institute for Theoretical Computer Science University of Karlsruhe, DKarlsruhe, Germany

DocID: 1sZ2t - View Document