Henkin, Monk and Tarski gave a compositional semantics for first-order predicate logic. We extend this work by including function symbols in the language and by giving the denotation of the atomic formula as a composition of the denotations of its predicate symbol and of its tuple of arguments. In addition we give the denotation of a term as a composition of the denotations of its function symb...

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Rening the method of diagrams we give a solution to an open problem of P. Hajek and P. Cintula (Conjectures 1 and 2 of [HaCi06]). We investigate also the properties of elementary extensions in witnessed ...

Abstract This paper focuses on the categoricity of arithmetic and determinacy arithmetical truth. Several ‘internal’ results have been discussed in recent literature. Against background philosophical position called internalism , we propose investigate truth-theoretic versions internal based a primitive truth predicate. We argue for compatibility predicate with provide novel argument (and proof...

In this paper we apply the UML-RSDS notation and tools to the “Hello World” case studies and explain the underlying development process for this model transformation approach. 1 Specification of model transformations In UML-RSDS a transformation specification is written in first-order logic and OCL, and consists of one or more predicates: 1. A global specification, Cons, of a model transformati...

We investigate uncertain reasoning with quantified sentences of the predicate calculus treated as the limiting case of maximum entropy inference applied to finite domains. Motivation and notation In this modest note we consider one possible approach to the following problem P: Suppose that my subjective beliefs in some sentences θ1, θ2, . . . , θm of a predicate language are constrained to sati...

The goal of instance matching is to detect identity resources, which refer to the same real-world object. In this paper, we introduce SLINT+, a novel interlinking system. SLINT+ detects all identity linked data resources between two given repositories. SLINT+ does not require the specifications of RDF predicates and labeled matching resources. SLINT+ performs competitively at OAEI instance matc...

Predicate abstraction has emerged to be a powerful technique for extracting nite-state models from in nite-state systems, and has been recently shown to enhance the e ectiveness of the reachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of linear predicates, the veri er performs an on-they search of the nite discrete quotient whose states...