3385 search results - page 411 / 677 » Language, Logic, and the Brain |
159
click to vote
LICS
1995
IEEE
15 years 10 months ago
1995
IEEE
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
221
click to vote
CONCUR
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. A syntax-directed formal system for the development of totally correct programs with respect to an (unfair) shared-state parallel programming language is proposed. The pr...
178
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
197
click to vote
POPL
2010
ACM
15 years 6 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
181
click to vote
JAIR
2008
15 years 6 months ago
2008
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...