31 search results - page 3 / 7 » A note on Bar Induction in Constructive Set Theory |
JAL
1998
13 years 7 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
CLA
2006
13 years 9 months ago
2006
Type signatures are common in modern linguistic theories. Their construction and maintenance is intricate, and therefore, an automatic induction method is desirable. In the present...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
ENTCS
2006
13 years 7 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
AAAI
2008
13 years 9 months ago
2008
The construction of causal graphs from non-experimental data rests on a set of constraints that the graph structure imposes on all probability distributions compatible with the gr...