Sciweavers

1302 search results - page 83 / 261
» Fair Equivalence Relations
Sort
View
ENTCS
2007
86views more  ENTCS 2007»
13 years 10 months ago
Simulations Up-to and Canonical Preorders: (Extended Abstract)
d abstract) David de Frutos Escrig1 ,3 Departamento de Sistemas Inform´aticos y Computaci´on Universidad Complutense de Madrid Madrid, Spain Carlos Gregorio Rodr´ıguez2 ,4 Depa...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
APAL
2005
73views more  APAL 2005»
13 years 10 months ago
Finite information logic
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...
Rohit Parikh, Jouko A. Väänänen
ACTA
1998
64views more  ACTA 1998»
13 years 10 months ago
Converting Untyped Formulas to Typed Ones
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
Jan Van den Bussche, Luca Cabibbo
MLQ
2007
65views more  MLQ 2007»
13 years 9 months ago
Non-standard analysis in ACA0 and Riemann mapping theorem
Abstract. This research is motivated by the program of Reverse Mathematics and non-standard arguments in second-order arithmetic. Within a weak subsystem of second order arithmetic...
Keita Yokoyama
JCT
2008
84views more  JCT 2008»
13 years 8 months ago
Wild triangles in 3-connected matroids
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connec...
James G. Oxley, Charles Semple, Geoff Whittle