Results 241 to 250 of about 88,869 (296)
Graph-based event schema induction in open-domain corpus. [PDF]
Yan K, Liu W, Xie S, Peng Y.
europepmc +1 more source
Expectations of doctoral students in the field of medicine and health sciences towards a graduate school: an online cross-sectional survey in Germany. [PDF]
Stock-Schröer B, Lange S.
europepmc +1 more source
Patient-Centered Leadership and Co-Design of Services for Breast Cancer Program in Nicaragua. [PDF]
Suárez ME +5 more
europepmc +1 more source
The proper treatment of variables in predicate logic
In §93 of The Principles of Mathematics, Bertrand Russell (1903) observes that “the variable is a very complicated logical entity, by no means easy to analyze correctly”. This assessment is borne out by the fact that even now we have no fully satisfactory understanding of the role of variables in a compositional semantics for first-order logic.
Kai F Wehmeier
exaly +3 more sources
Predicate calculus with free quantifier variables
In the literature of symbolic logic there are many examples of systems having free variables ranging over truth-values, individuals, or predicates. But, though many such systems are equipped with universal and existential quantifiers (and though many other quantifiers, e.g., for exactly one, are thereby definable), the problem of free variables ...
Thomason, Richmond H. +1 more
openaire +3 more sources
Elementary Particles, Hidden Variables, And Hidden Predicates
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Adonai S. Sant’Anna
openaire +2 more sources
The Monotonous Elimination of Predicate Variables
The author describes an algorithm which, given a sentence \(\Gamma\) involving universally quantified predicate variables, first reduces this sentence to a normal form \(\Gamma^*\) and then, if \(\Gamma^*\) satisfies certain extra restrictions, eliminates the predicate variables of \(\Gamma^*\) to produce a predicate-free equivalent of \(\Gamma\).
Harold Simmons
openaire +2 more sources
Relational and partial variable sets and basic predicate logic
AbstractIn this paper we study the logic of relational and partial variable sets, seen as a generalization of set-valued presheaves, allowing transition functions to be arbitrary relations or arbitrary partial functions. We find that such a logic is the usual intuitionistic and co-intuitionistic first order logic without Beck and Frobenius conditions ...
Ghilardi, Silvio, Meloni, Giancarlo
openaire +2 more sources
Computational improvements in Prolog applications by predicate variable pointers
The programming tradeoffs between structure-oriented and clause-oriented operations on data structures in Prolog are limited in current implementations because the assertion of clauses that include uninstantiated variables destroys any binding between these variables and those with which they are unified in the execution of the program.
G.M. Karam
openaire +2 more sources

