clausal

In other words, we find the following finite clausal structures:

Another possible modification to the clausal hypothesis concerns the claim it makes about clause interpretation.

In clausal logic, the program is represented by the set of clauses:

Clausal nominals are such things as sentential subjects and compliments.

Occasionally, marked surface clausal configurations provide some evidence of a more formal, or poetic, register.

They may also function as clausal predicates.

However, the first proposal to use the clausal form of logic for representing computer programs was made by Cordell Green (1969).

Converting all information to clausal form is problematic because it hides the underlying structure of the information.

Extending this convention to the clausal categories occurred in the interest of the consistent use of labels.

This will be automatically converted into clausal form (which Prover9 also accepts):

Converted everything to clausal form.

Clausal backgrounding and pronominal reference: A functionalist approach to c-command.

We will consider the second claim of the clausal hypothesis first, since it relates to some of the findings which we have just been discussing.

"Everything said is said by an observer": the cognitive distinction between the infinitive/participle clausal arguments.

The connectedness conditions, when applied to the propositional (clausal) case, make the resulting calculus non-confluent.

Various languages have been shown to have clausal nominal TAM.

Unit types include: lexical, clausal, phrasal, and sentential.

Relative clauses on A use clausal nominalisation.

A final group of suffixes that pertain to clausal relations can follow the tense-aspect-modal suffixes.

Nor is clausal intonation, as question particles and changes in word order serve many of the functions that intonation performs in English.

But why is it that the predicate qualifier construction can carry both meanings while the clausal construction fits only the "unacquainted" version?

It can be seen as a generalization of either resolution (to equational logic) or unfailing completion (to full clausal logic).

Then used resolution to attempt to obtain a proof by contradiction by adding the clausal form of the negation of the theorem to be proved.

Uncomplicated clausal structure (e.g., no embedded clauses, etc.)

More generally, the term disjunct can be used to refer to any sentence element that is not fully integrated into the clausal structure of the sentence.