Results 221 to 230 of about 45,874 (260)

First-order sequent calculi of logics of quasiary predicates with extended renominations and equality

PROBLEMS IN PROGRAMMING, 2022
The paper considers new classes of software-oriented logical formalisms – pure first-order logics of partial quasiary predicates with extended renomi- nations and predicates of strong equality and of weak equality.
О.S. Shkilniak, S.S. Shkilniak
openaire   +1 more source

An incremental approach to local equality predicates in OBJ specification languages

2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE), 2014
OBJ algebraic specification languages support automated equational reasoning based on term rewriting for interactive verification. The equational reasoning is sound but not always complete in general. In our previous work, we have given a condition for sound and complete equational reasoning for OBJ specifications and have proposed the notion of local ...
Masaki Nakamura, Kokichi Futatsugi
openaire   +1 more source

Does Seven-Fold Predication Equal Four-Cornered Negation Reversed?

Philosophy East and West, 1957
THE PATTERN OF THE Jain seven-fold syadvda is sufficiently peculiar, when compared with other types of logical theory, to stimulate curiosity concerning how it arose and what, if any, relations it may have with other significant patterns. Jain doctrine' presupposes the existence of something which manifests itself through many aspects, each of which ...
openaire   +1 more source

Real-valued models with metric equality and uniformly continuous predicates

Journal of Symbolic Logic, 1982
AbstractTwo real-valued deduction schemes are introduced, which agree on ⊢ ⊿ but not on Γ ⊢ ⊿, where Γ and ⊢ are finite sets of formulae. Using the first scheme we axiomatize real-valued equality so that it induces metrics on the domains of appropriate structures.
openaire   +1 more source

The problem of choosing between using and avoiding equality predicates

Journal of Automated Reasoning, 1992
This article is the twentieth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find criteria for effectively choosing between using and avoiding equality predicates. Since there exist inference rules (such as paramodulation) that enable an automated reasoning program
openaire   +1 more source

Equality and Predicate Abstraction

2023
Melvin Fitting, Richard L. Mendelsohn
openaire   +1 more source

A method of epsilon substitution for the predicate logic with equality

Journal of Mathematical Sciences, 1997
The method of epsilon substitution for arithmetic proposed by Hilbert proceeds by a series of finite approximations ``from below'' to a solution of a fixed system of critical formulas. Ackermann applied the method also to the first order predicate logic with equality and extensionality formalized in terms of the epsilon symbol, which however proceeds ``
openaire   +1 more source

Experiments with a heuristic theorem-proving program for predicate calculus with equality

Artificial Intelligence, 1971
Abstract A new theorem-proving program to solve problems expressed in the first-order predicate calculus with equality has been implemented and extensively tested. The basic algorithm employs resolution and paramodulation as its rules of inference, and uses set-of-support and input strategies.
openaire   +1 more source

Corrosion Predication in Refinery Based on Not Equal Time Interval Grey System Model

2010 2nd International Workshop on Intelligent Systems and Applications, 2010
The equipment exposed to wash erosion seriously when the refinery process high-sulfur crude oil. Used FLUENT to emulate fluid field can help us to find the place to monitor. Measured the wall thickness of the elbow on the entrance of the atmospheric distillation tower top exchangers by ultrasonic thickness meter every month, established standard GM(1,1)
openaire   +1 more source

Normal Form for Deductions in Predicate Calculus with Equality and Functional Symbols

1969
It is known how useful an apparatus the G. Gentzen [1] fundamental theorem turns out to be in investigations concerning predicate calculus. The plan of a finite proof of the possibility of extending the fundamental theorem to predicate calculus with equality and functional symbols is proposed herein.
openaire   +1 more source