1101 search results - page 95 / 221 » Forcing in proof theory |
111
click to vote
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
100
Voted
TLCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
115
click to vote
IANDC
2007
15 years 17 days ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
130
click to vote
SP
2008
IEEE
14 years 11 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
102
Voted
ICFP
2007
ACM
16 years 17 days ago
2007
ACM
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...