Results 1  10
of
1,253,392
Domain Theory in Logical Form
 Annals of Pure and Applied Logic
, 1991
"... The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and system ..."
Abstract

Cited by 252 (10 self)
 Add to MetaCart
and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic
On Logical Form
, 2002
"... A Logical Form (LF) is a syntactic structure that is interpreted by the semantic component. For a particular structure to be a possible LF it has to be possible for syntax to generate it and for semantics to interpret it. The study of LF must therefore take into account both assumptions about syntax ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
A Logical Form (LF) is a syntactic structure that is interpreted by the semantic component. For a particular structure to be a possible LF it has to be possible for syntax to generate it and for semantics to interpret it. The study of LF must therefore take into account both assumptions about
Logical Form
"... Abstract. The notion of the logical form of an expression E is shown to be a semantic notion that can be derived from the notion of the structured meaning of E. This simple idea can be traced to categorial grammars, and it is implicitly used by Richard Montague. We argue that a most finegrained too ..."
Abstract
 Add to MetaCart
Abstract. The notion of the logical form of an expression E is shown to be a semantic notion that can be derived from the notion of the structured meaning of E. This simple idea can be traced to categorial grammars, and it is implicitly used by Richard Montague. We argue that a most fine
Resolving Quasi Logical Forms
 Computational Linguistics
, 1990
"... This paper is concerned with the relationship between the linguistic analysis of sentences and their interpretation in context. Our model is described as implemented in the Core Language Engine (CLE), a domainindependent system for translating natural language sentences into logical form representa ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
This paper is concerned with the relationship between the linguistic analysis of sentences and their interpretation in context. Our model is described as implemented in the Core Language Engine (CLE), a domainindependent system for translating natural language sentences into logical form
Exploiting logical forms
"... The Delilah parser and generator for Dutch delivers three related levels of logical form: Stored Logical Form, Normal Logical Form and Flat Logical Form. SLF is produced by graph unification of attributevalue matrices as the value of a semantic feature. It is an underspecified level of semantic rep ..."
Abstract
 Add to MetaCart
The Delilah parser and generator for Dutch delivers three related levels of logical form: Stored Logical Form, Normal Logical Form and Flat Logical Form. SLF is produced by graph unification of attributevalue matrices as the value of a semantic feature. It is an underspecified level of semantic
Logical Form and Language
"... World, asserted famously that ‘every philosophical problem, when it is subjected to the necessary analysis and purification, is found either to be not really philosophical at all, or else to be, in the sense in which we are using the word, logical ’ (Russell 1993, p. 42). He went on to characterize ..."
Abstract
 Add to MetaCart
that portion of logic that concerned the study of forms of propositions, or, as he called them, ‘logical forms’. This portion of logic he called ‘philosophical logic’. Russell asserted that... some kind of knowledge of logical forms, though with most people it is not explicit, is involved in all understanding
Dynamic Logic
 Handbook of Philosophical Logic
, 1984
"... ed to be true under the valuation u iff there exists an a 2 N such that the formula x = y is true under the valuation u[x=a], where u[x=a] agrees with u everywhere except x, on which it takes the value a. This definition involves a metalogical operation that produces u[x=a] from u for all possibl ..."
Abstract

Cited by 1008 (7 self)
 Add to MetaCart
possible values a 2 N. This operation becomes explicit in DL in the form of the program x := ?, called a nondeterministic or wildcard assignment. This is a rather unconventional program, since it is not effective; however, it is quite useful as a descriptive tool. A more conventional way to obtain a
Problems In Logical Form
, 1981
"... This paper surveys what we at SRI view as some of the key problems encountered in defining a system of representation for the logical forms of English sentences, and suggests possible approaches to their solution. We will first look at some general issues related to the notion of logical form, and t ..."
Abstract
 Add to MetaCart
This paper surveys what we at SRI view as some of the key problems encountered in defining a system of representation for the logical forms of English sentences, and suggests possible approaches to their solution. We will first look at some general issues related to the notion of logical form
Logical Form and TruthConditions∗
"... ABSTRACT: This paper outlines a truthconditional view of logical form, that is, a view according to which logical form is essentially a matter of truthconditions. Section 1 provides some preliminary clarifications. Section 2 shows that the main motivation for the view is the fact that fundamental ..."
Abstract
 Add to MetaCart
ABSTRACT: This paper outlines a truthconditional view of logical form, that is, a view according to which logical form is essentially a matter of truthconditions. Section 1 provides some preliminary clarifications. Section 2 shows that the main motivation for the view is the fact
Designer Definites in Logical Form
, 1990
"... this paper, we represent singular definite noun phrases as functions in logical form. This representation is designed to model the behaviors of both anaphoric and nonanaphoric, distributive defthires. It is also designed to obey the computationsd constraints suggested in Harper that88]. Our initial ..."
Abstract
 Add to MetaCart
this paper, we represent singular definite noun phrases as functions in logical form. This representation is designed to model the behaviors of both anaphoric and nonanaphoric, distributive defthires. It is also designed to obey the computationsd constraints suggested in Harper that88]. Our
Results 1  10
of
1,253,392