Add to ORKGThis paper reports on the empirical coverage of Type Logical Grammar (TLG) and on how it has been computer implemented. We analyse the Montague fragment computationally and we proffer this task as a challenge to computational grammar: the Montague TestPeer ReviewedPostprint (author's final draft
University of Minnesota Ph.D. dissertation. 1893. Major: Grammar. 1 computer file (PDF); 125 pages
We construct Scott domains well suited to use in an abstract implementation of logic programming, an...
This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory ...
It is nearly half a century since Montague made his contributions to the field of logical semantics...
This paper reports on the empirical coverage of Type Logical Grammar (TLG) and on how it has been co...
This paper aims to show how Montague-style grammars can be completely formalized and thereby declara...
We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devis...
This work develops efficient methods for the implementation of Montague Grammar on a computer. It c...
We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devis...
Logical connectives (otherwise known as 'logical constants' or 'logical particles') have seemed chal...
Girard (1987) introduced proof nets as a syntax of linear proofs which eliminates inessential rule ...
CatLog3 is a Prolog parser/theorem-prover for (type) logical (categorial) grammar. In such logical g...
MR1489405 (98m:03120) In sequent calculus, MIX refers to the following structural rule: From Gamma ...
My point in this paper is to focus on some details of Alfred Tarski’s writing that in my opinion hav...
An introduction to the discipline of logic covering subjects from the structures of arguments, class...
University of Minnesota Ph.D. dissertation. 1893. Major: Grammar. 1 computer file (PDF); 125 pages
We construct Scott domains well suited to use in an abstract implementation of logic programming, an...
This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory ...
It is nearly half a century since Montague made his contributions to the field of logical semantics...
This paper reports on the empirical coverage of Type Logical Grammar (TLG) and on how it has been co...
This paper aims to show how Montague-style grammars can be completely formalized and thereby declara...
We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devis...
This work develops efficient methods for the implementation of Montague Grammar on a computer. It c...
We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devis...
Logical connectives (otherwise known as 'logical constants' or 'logical particles') have seemed chal...
Girard (1987) introduced proof nets as a syntax of linear proofs which eliminates inessential rule ...
CatLog3 is a Prolog parser/theorem-prover for (type) logical (categorial) grammar. In such logical g...
MR1489405 (98m:03120) In sequent calculus, MIX refers to the following structural rule: From Gamma ...
My point in this paper is to focus on some details of Alfred Tarski’s writing that in my opinion hav...
An introduction to the discipline of logic covering subjects from the structures of arguments, class...
University of Minnesota Ph.D. dissertation. 1893. Major: Grammar. 1 computer file (PDF); 125 pages
We construct Scott domains well suited to use in an abstract implementation of logic programming, an...
This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory ...