Results 211 to 220 of about 11,089 (266)
Some of the next articles are maybe not open access.
2023
Abstract The acceptance of a regimented theory involves both an ontological commitment to the entities in the domain of the theory and a judgment that certain predicates to be applied to those entities are admissible predicates. This chapter is about predication: the criteria for admissibility and the compositional role of predicates in ...
openaire +1 more source
Abstract The acceptance of a regimented theory involves both an ontological commitment to the entities in the domain of the theory and a judgment that certain predicates to be applied to those entities are admissible predicates. This chapter is about predication: the criteria for admissibility and the compositional role of predicates in ...
openaire +1 more source
IEEE Transactions on Visualization and Computer Graphics, 2006
Predicates are functions that return Boolean values. They are an essential tool in computer science. A close look at flow feature definitions reveals that they can be seen as point predicates that tell if a specific feature exists at a certain point. Besides the information about features, scientists and engineers like to know the overall behavior of ...
Tobias, Salzbrunn, Gerik, Scheuermann
openaire +2 more sources
Predicates are functions that return Boolean values. They are an essential tool in computer science. A close look at flow feature definitions reveals that they can be seen as point predicates that tell if a specific feature exists at a certain point. Besides the information about features, scientists and engineers like to know the overall behavior of ...
Tobias, Salzbrunn, Gerik, Scheuermann
openaire +2 more sources
Synthese, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Acta Informatica, 1986
We introduce a predicative semantics of programs and show its use in programming. With it, logic errors can be detected and reported when they are made, just like syntax errors. Programming paradigms are stated precisely as theorems. The use of paradigms in larger programs is shown to be the same as the mathematician's use of theorems in the proof of ...
Hehner, Eric C. R. +2 more
openaire +2 more sources
We introduce a predicative semantics of programs and show its use in programming. With it, logic errors can be detected and reported when they are made, just like syntax errors. Programming paradigms are stated precisely as theorems. The use of paradigms in larger programs is shown to be the same as the mathematician's use of theorems in the proof of ...
Hehner, Eric C. R. +2 more
openaire +2 more sources
2009
AbstractWhether a predicate is a referential expression depends upon what reference is conceived to be. Even if it is granted that reference is a relation between words and worldly items, the referents of expressions being the items to which they are so related, this still leaves considerable scope for disagreement about whether predicates refer.
openaire +1 more source
AbstractWhether a predicate is a referential expression depends upon what reference is conceived to be. Even if it is granted that reference is a relation between words and worldly items, the referents of expressions being the items to which they are so related, this still leaves considerable scope for disagreement about whether predicates refer.
openaire +1 more source
2015
AbstractThis chapter discusses a grammatically defined sub-class of focus: that on verbal predicates and on functional elements in the extended verbal projection. The phenomena falling under the label of predicate focus are introduced, and it is shown that predicate focus is interpretable on a par with argument or term focus on DPs and PPs.
openaire +2 more sources
AbstractThis chapter discusses a grammatically defined sub-class of focus: that on verbal predicates and on functional elements in the extended verbal projection. The phenomena falling under the label of predicate focus are introduced, and it is shown that predicate focus is interpretable on a par with argument or term focus on DPs and PPs.
openaire +2 more sources
1997
Abstract Intransitive Predication constitutes a major contribution to the study of typological linguistics and theoretical linguistics in general. Basing his analysis on a sample of 410 languages, Leon Stassen investigates cross-linguistic variation in one of the core domains of all natural languages. The author views this domain as a
openaire +2 more sources
Abstract Intransitive Predication constitutes a major contribution to the study of typological linguistics and theoretical linguistics in general. Basing his analysis on a sample of 410 languages, Leon Stassen investigates cross-linguistic variation in one of the core domains of all natural languages. The author views this domain as a
openaire +2 more sources
Complex predicates and predicate raising
Lingua, 2003This paper discusses major issues that have arisen in the analysis of sentences with complex predicates in Japanese from early transformational grammar to the present minimalist program. Particular emphasis is placed on the treatment of the causative construction to assess the influence of the lexicalist hypothesis and its aftermath.
openaire +1 more source
1987
The paper deals with conceptual, mathematical and practical aspects of developing a net theoretic system model. The model presented is based on common techniques of modelling static systems as structured sets of individuals (relational structures). These structures are ‘dynamised’ by allowing some relations between individuals to be changed by the ...
openaire +1 more source
The paper deals with conceptual, mathematical and practical aspects of developing a net theoretic system model. The model presented is based on common techniques of modelling static systems as structured sets of individuals (relational structures). These structures are ‘dynamised’ by allowing some relations between individuals to be changed by the ...
openaire +1 more source
Predicates, predicate transformers and refinement
1990Data reification is generalized, allowing “abstract” data to be implemented by parallel processes. He Jifeng and Hoare's [He Jifeng] approach to integrate theories for ”programs as predicates” and ”programs as predicate transformers”, is generalized to parallel processes and is used to formulate syntactic verification conditions to check the ...
openaire +1 more source