Sciweavers

3552 search results - page 311 / 711
» Proof theory in the abstract
Sort
View
AML
2002
70views more  AML 2002»
15 years 6 months ago
On the formal points of the formal topology of the binary tree
Abstract Formal topology is today an established topic in the development of constructive mathematics and constructive proofs for many classical results of general topology have be...
Silvio Valentini
CCS
2010
ACM
15 years 4 months ago
Developing security protocols by refinement
We propose a development method for security protocols based on stepwise refinement. Our refinement strategy guides sformation of abstract security goals into protocols that are s...
Christoph Sprenger, David A. Basin
ADCM
2011
15 years 1 months ago
Perturbed preconditioned inverse iteration for operator eigenvalue problems with applications to adaptive wavelet discretization
ABSTRACT. In this paper we discuss an abstract iteration scheme for the calculation of the smallest eigenvalue of an elliptic operator eigenvalue problem. A short and geometric pro...
Thorsten Rohwedder, Reinhold Schneider, Andreas Ze...
CADE
2006
Springer
16 years 7 months ago
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...
CALCO
2007
Springer
95views Mathematics» more  CALCO 2007»
16 years 27 days ago
Higher Dimensional Trees, Algebraically
In formal language theory, James Rogers published a series of innovative papers generalising strings and trees to higher dimensions.Motivated by applications in linguistics, his go...
Neil Ghani, Alexander Kurz