1101 search results - page 56 / 221 » Forcing in proof theory |
150
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
134
Voted
TLCA
2005
Springer
15 years 9 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
106
click to vote
TIT
2002
15 years 3 months ago
2002
Abstract--In this paper, we establish a one-to-one correspondence between information inequalities and group inequalities. The major implication of our result is that we can prove ...
134
Voted
JSYML
2010
14 years 10 months ago
2010
Abstract. Building on Hrushovski's work in [5], we study definable groupoids in stable theories and their relationship with 3-uniqueness and finite internal covers. We introdu...
127
Voted
FASE
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...