Sciweavers

1101 search results - page 84 / 221
» Forcing in proof theory
Sort
View
MSCS
2006
53views more  MSCS 2006»
15 years 16 days ago
Random reals and Lipschitz continuity
Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...
Andrew E. M. Lewis, George Barmpalias
TAP
2008
Springer
153views Hardware» more  TAP 2008»
15 years 15 days ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
95
Voted
FAC
1998
111views more  FAC 1998»
15 years 8 days ago
A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
Henri Korver, M. P. A. Sellink
101
Voted
JACM
2002
122views more  JACM 2002»
15 years 8 days ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
ICFP
2010
ACM
15 years 1 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao