Sciweavers

119 search results - page 17 / 24
» The First-Order Isomorphism Theorem
Sort
View
EJC
2008
13 years 7 months ago
Grad and classes with bounded expansion II. Algorithmic aspects
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
Jaroslav Nesetril, Patrice Ossona de Mendez
LICS
2008
IEEE
14 years 1 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
FROCOS
2005
Springer
14 years 1 months ago
A Comprehensive Framework for Combined Decision Procedures
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
TYPES
2000
Springer
13 years 11 months ago
Constructive Reals in Coq: Axioms and Categoricity
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...
Herman Geuvers, Milad Niqui
JSYML
2008
82views more  JSYML 2008»
13 years 7 months ago
The number of openly generated Boolean algebras
This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly -filtered Boolean algebras. We show that for ...
Stefan Geschke, Saharon Shelah