Sciweavers

APAL
2010
97views more  APAL 2010»
13 years 5 months ago
The free n-generated BL-algebra
The theory of Schauder hats is a beautiful and powerful tool for investigating, under several respects, the algebraic semantics of Lukasiewicz infinite-valued logic [CDM99], [MMM07...
Stefano Aguzzoli, Simone Bova
APAL
2008
95views more  APAL 2008»
13 years 7 months ago
Cartesian closed Dialectica categories
When G
Bodil Biering
APAL
2007
83views more  APAL 2007»
13 years 7 months ago
On Feferman's operational set theory OST
We study OST and some of its most important extensions primarily from a proof-theoretic perspective, determine their consistency strengths by exhibiting equivalent systems in the ...
Gerhard Jäger
APAL
2007
99views more  APAL 2007»
13 years 7 months ago
A categorical semantics for polarized MALL
In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic MALLP, which is the linear fragment (without structural rules) of Olivier Laurent...
Masahiro Hamano, Philip J. Scott
APAL
2007
65views more  APAL 2007»
13 years 7 months ago
Increasing the groupwise density number by c.c.c. forcing
We show that ℵ2 ≤ b < g is consistent. This work is dedicated to James Baumgartner on the occasion of his 60th birthday.
Heike Mildenberger, Saharon Shelah
APAL
2007
77views more  APAL 2007»
13 years 7 months 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
APAL
2007
131views more  APAL 2007»
13 years 7 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
APAL
2007
59views more  APAL 2007»
13 years 7 months ago
On the Turing degrees of minimal index sets
We study generalizations of shortest programs as they pertain to Schaefer’s MIN∗ problem. We identify sets of m-minimal and T-minimal indices and characterize their truth-tabl...
Jason Teutsch
APAL
2007
119views more  APAL 2007»
13 years 7 months 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
APAL
2007
72views more  APAL 2007»
13 years 7 months ago
On definable filters in computably enumerable degrees
Based on a result of Nies on definability the upper semilattice of computably enumerable degrees (denoted by R), we find that in R filters generated by definable subsets are al...
Wei Wang, Decheng Ding