3047 search results - page 247 / 610 » On the Meaning of Logical Completeness |
183
click to vote
IANDC
2010
15 years 6 months ago
2010
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
147
Voted
SYNTHESE
2010
15 years 6 months ago
2010
In this paper I suggest an answer to the question of what Frege means when he says that his logical system, the Begriffsschrift, is like the language Leibniz sketched, a lingua ch...
238
click to vote
PPDP
2007
Springer
16 years 1 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
179
click to vote
CADE
2003
Springer
16 years 8 months ago
2003
Springer
The DPLL procedure is the basis of some of the most successful propositional satisfiability solvers to date. Although originally devised as a proofprocedure for first-order logic, ...
202
Voted
PPDP
2007
Springer
16 years 1 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...