Sciweavers

148 search results - page 22 / 30
» apal 2007
Sort
View
101
Voted
APAL
2007
119views more  APAL 2007»
15 years 20 days ago
An algebraic approach to subframe logics. Intuitionistic case
We develop duality between nuclei on Heyting algebras and certain binary relations on Heyting spaces. We show that these binary relations are in 1–1 correspondence with subframe...
Guram Bezhanishvili, Silvio Ghilardi
81
Voted
APAL
2007
77views more  APAL 2007»
15 years 20 days ago
The hyper-weak distributive law and a related game in Boolean algebras
We discuss the relationship between various weak distributive laws and games in Boolean algebras. In the first part we give some game characterizations for certain forms of Prikr...
James Cummings, Natasha Dobrinen
78
Voted
APAL
2007
71views more  APAL 2007»
15 years 20 days ago
A lower bound for intuitionistic logic
We give an exponential lower bound on number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL...
Pavel Hrubes
109
Voted
APAL
2007
88views more  APAL 2007»
15 years 20 days ago
Randomness and the linear degrees of computability
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
Andrew E. M. Lewis, George Barmpalias
78
Voted
APAL
2007
104views more  APAL 2007»
15 years 20 days ago
Non-well-founded trees in categories
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
Benno van den Berg, Federico De Marchi