Sciweavers

1948 search results - page 20 / 390
» Formalizing Mirror Theory
Sort
View
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
14 years 11 days ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo
AISC
2010
Springer
13 years 12 months ago
A Formal Quantifier Elimination for Algebraically Closed Fields
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
Cyril Cohen, Assia Mahboubi
ASIAN
2004
Springer
78views Algorithms» more  ASIAN 2004»
14 years 2 months ago
A Simple Theory of Expressions, Judgments and Derivations
We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give...
Masahiko Sato
APSEC
2001
IEEE
14 years 8 days ago
The Steam Boiler in a Unified Theory of Z and CSP
This paper presents a formalisation of the steamboiler problem using Circus, a unified theory of the formal specification languages Z and CSP. The aim of Circus is to provide powe...
Jim Woodcock, Ana Cavalcanti
RIVF
2007
13 years 10 months ago
Generalized Percolation Processes Using Pretopology Theory
Abstract— We propose in this paper a generalization of percolation processes in Z2 using the pretopology theory. We formalize the notion of neighborhood by extending it to the co...
Soufian Ben Amor, V. Levorato, Ivan Lavallé...