Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

Most work on the semantic paradoxes within classical logic has centered around what this essay calls “linguistic” accounts of the… Expand

2003

2003

In Lassez and Marriott (J. Automat. Reson. 3 (3) (1987) 301-317), explicit and implicit generalizations were studied as… Expand

Highly Cited

2000

Highly Cited

2000

set of n-tuples description Vw(λ~x.φ) {w | Vw(λ~x.φ) = E} (E ⊆ Dn) question proposition partition answerhood {v | Vv(λ~x.φ) = Vw… Expand

1996

1996

Abstract Chronolog(MC) is an extension of logic programming based on a linear-time temporal logic with multiple granularity of… Expand

Highly Cited

1993

Highly Cited

1993

Structured meanings have evolved as a well-suited tool to describe the semantics of focus constructions. In this paper, the A… Expand

1992

1992

An equational formula is a first order formula over an alphabet F of function symbols and the equality predicate symbol. Such… Expand

Highly Cited

1992

Highly Cited

1992

In this paper we propose a rich notion of directionality of predicates that combines modes and regular tree types. We provide a… Expand

Highly Cited

1991

Highly Cited

1991

A general framework for translating logical formulae from one logic into another logic is presented. The framework is… Expand

Highly Cited

1989

Highly Cited

1989

Roughly speaking, an equational problem is a first order formula whose only predicatesymbol is =. We propose some rules for the… Expand

Highly Cited

1976

Highly Cited

1976

Let be a finite set of (nonlogical) predicate symbols. By an -structure, we mean a relational structure appropriate for . Let be… Expand