Results 131 to 140 of about 4,636,755 (203)
, 1969 Below C, A, and S5* will denote the classical, positive (absolute)†† predicate calculus, respectively without functional symbols, and the quantifier extension of the Lewis modal calculus S5 (see [1], for example).
V. P. Orevkov
semanticscholar +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Relational and partial variable sets and basic predicate logic
Journal of Symbolic Logic, 1996AbstractIn 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 ...
S. Ghilardi, G. Meloni
semanticscholar +3 more sources
The proper treatment of variables in predicate logic
Linguistics and Philosophy, 2018In §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.
K. Wehmeier
semanticscholar +3 more sources
Predicate calculus with free quantifier variables
Journal of Symbolic Logic, 1969 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 ...
Richmond H. Thomason, Denise R. Johnson
openalex +4 more sources
Sparse Analysis of Variable Path Predicates Based upon SSA-Form
Leveraging Applications of Formal Methods, 2016Static Single Assignment Form benefits data flow analysis by its static guarantees on the definitions and uses of variables. In this paper, we show how to exploit these guarantees to enable a sparse data flow analysis of variable predicates, for gaining a rich predicate-based and path-oriented characterization of the values of program variables.
Thomas S. Heinze, W. Amme
semanticscholar +3 more sources
Analysis and visualization of predicate dependence on formal parameters and global variables
IEEE Transactions on Software Engineering, 2004 Empirical data concerning the qualitative and quantitative nature of program dependence is presented for a set of 20 programs ranging from 600 lines of code to 167,000 lines of code. The sources of dependence considered are global variables and formal parameters and the targets considered are a program's predicate nodes.
David Binkley, Mark Harman
openalex +4 more sources
Reductions for the satisfiability with a simple interpretation of the predicate variable
Logic and Machines, 1983M. Deutsch
semanticscholar +3 more sources
Improving Business Failure Predication Using Rough Sets with Non-financial Variables
, 2007 Rough set models with financial variables have proven to be effective in predicting business failure. To enhance the predictive performance of rough set models, this paper includes a non-financial variable, auditor switching, into the modeling process, in addition to 14 financial ratios commonly used in business failure research.
Jao‐Hong Cheng +2 more
openalex +3 more sources
Mathematical Notes of the Academy of Sciences of the USSR, 1990 A. L. Rastsvetaev
openalex +3 more sources
Sparsification of Two-Variable Valued Constraint Satisfaction Problems
SIAM Journal on Discrete Mathematics, 2017A valued constraint satisfaction problem (VCSP) instance $(V,\Pi,w)$ is a set of variables $V$ with a set of constraints $\Pi$ weighted by $w$. Given a VCSP instance, we are interested in a reweighted subinstance $(V,\Pi'\subset \Pi,w')$ that preserves ...
Arnold Filtser, Robert Krauthgamer
semanticscholar +1 more source