Results 251 to 260 of about 48,321 (304)
Some of the next articles are maybe not open access.

Related searches:

Predicates and Predication

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

Streamline Predicates

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

Predicative methodology

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 ...
Eric C. R. Hehner   +2 more
openaire   +2 more sources

Existence predicates

Synthese, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

PREDICATION AND EXTENSIONALIZATION

Journal of Philosophical Logic, 2008
The author agrees with McGinn that (empirical) predicates denote properties rather than sets but shows that this view cannot be justified without ensuring type-congruity: properties are intensions, i.e., functions from possible worlds, and therefore they have to be ``extensionalized'' before being predicated to objects.
openaire   +3 more sources

Predicate Subtyping with Predicate Sets

2001
We show how PVS-style predicate subtyping can be simulated in HOL using predicate sets, and explain how to perform subtype checking using this model. We illustrate some applications of this to specification and verification in HOL, and also demonstrate some limits of the approach.
openaire   +2 more sources

Predicates, predicate transformers and refinement

1990
Data 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   +2 more sources

Home - About - Disclaimer - Privacy