Results 81 to 90 of about 970 (166)

Characterizing classes defined without equality [PDF]

open access: yes, 1997
In this paper we mainly deal with first-order languages without equality and introduce a weak form of equality predicate, the so-called Leibniz equality. This equality is characterized algebraically by means of a natural concept of congruence;
Aplicada Ii   +2 more
core  

On Equality of Lines with Positional Uncertainty [PDF]

open access: yes, 2010
Geometric reasoning in vector based geographic information systems (GIS) is based on Euclidean geometry. Euclid's first postulate, saying that the line determined by two points is unique, makes geometric constructions unambiguous, and, e.g., allows for ...
Wilke, Gwendolin, Frank, Andrew U.
core  

First-order transitional modal logics of quasiary predicates with equality

open access: yesBulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics
In this paper we study new classes of program-oriented logical formalisms of the modal type – first-order transitional modal logics (TML) of quasiary predicates with equality. Modal logics are successfully used for describing and modeling various subject areas.
openaire   +1 more source

Extending higher-order logic with predicate subtyping: Application to PVS [PDF]

open access: yes, 2018
The type system of higher-order logic allows to exclude some unexpected expressions such as the application of a predicate to itself. However, it is not sufficient to verify more complex criteria such as the absence of divisions by zero.
Gilbert, Frédéric
core   +1 more source

A SPECTRUM HIERARCHY [PDF]

open access: yes, 2008
Let 9 be a finite similarity type, that is, a finite set of (nonlogical) predicate symbols. By an 9’-structure, we mean a relational structure suitable for 9.

core  

Transcendental syntax 2: non deterministic case [PDF]

open access: yes, 2015
Using a non deterministic analytics, it is possible to expand the au- tonomous explanation of logic, a.k.a. transcendental syntax, to full logic, i.e., first order predicate calculus with equality.
Girard, Jean-Yves
core  

Home - About - Disclaimer - Privacy