Sciweavers

APAL
2008
84views more  APAL 2008»
13 years 11 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
APAL
2008
79views more  APAL 2008»
13 years 11 months ago
Intermediate logics and factors of the Medvedev lattice
We investigate the initial segments of the Medvedev lattice as Brouwer algebras, and study the propositional logics connected to them.
Andrea Sorbi, Sebastiaan Terwijn
APAL
2008
96views more  APAL 2008»
13 years 11 months ago
On superstable CSA-groups
We show that an existentially closed CSA -group is not superstable. We prove that a non-abelian superstable CSA-group has an infinite definable simple subgroup all of whose proper...
Abderezak Ould Houcine
APAL
2008
83views more  APAL 2008»
13 years 11 months ago
Easton's theorem and large cardinals
The continuum function F on regular cardinals is known to have great freedom; if , are regular cardinals, then F needs only obey the following two restrictions: (1) cf(F()) > ...
Sy D. Friedman, Radek Honzik
APAL
2008
90views more  APAL 2008»
13 years 11 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger
APAL
2008
45views more  APAL 2008»
13 years 11 months ago
A sequent calculus for limit computable mathematics
Stefano Berardi, Yoriyuki Yamagata
APAL
2008
75views more  APAL 2008»
13 years 11 months ago
Call-by-name reduction and cut-elimination in classical logic
Abstract. We present a version of Herbelin's
Kentaro Kikuchi
APAL
2008
78views more  APAL 2008»
13 years 11 months ago
Strong normalization of classical natural deduction with disjunctions
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper...
Koji Nakazawa, Makoto Tatsuta
APAL
2008
159views more  APAL 2008»
13 years 11 months ago
Approximations of modal logics: K and beyond
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...
Guilherme de Souza Rabello, Marcelo Finger