Sciweavers

211 search results - page 2 / 43
» On the Proof Theory of the Existence Predicate
Sort
View
RSA
1998
59views more  RSA 1998»
14 years 11 months ago
Random unary predicates: Almost sure theories and countable models
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1) . F...
Joel Spencer, Katherine St. John
PPDP
2009
Springer
15 years 4 months ago
Context-based proofs of termination for typed delimited-control operators
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
Malgorzata Biernacka, Dariusz Biernacki
IANDC
2007
133views more  IANDC 2007»
14 years 11 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
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 ...
Alexander Rabinovich
IWFM
1998
15 years 22 days ago
Motivation for a New Semantics for Vagueness
Vagueness is the phenomenon that natural language predicates have borderline regions of applicability and that the boundaries of the borderline region are not determinable. A theo...
Mark Changizi
MKM
2004
Springer
15 years 4 months ago
Predicate Logic with Sequence Variables and Sequence Function Symbols
We describe an extension of first-order logic with sequence variables and sequence functions. We define syntax, semantics and inference system for the extension so that Completen...
Temur Kutsia, Bruno Buchberger