Results 41 to 50 of about 970 (166)
Lattice of $E$-closed Classes of Multifunctions of Rank 2
Известия Иркутского государственного университета: Серия "Математика"Multifunctions are discrete functions defined on a finite set and returning as their values all subsets of the considered set. The paper considers the classification of multifunctions defined on a two-element set with respect to the E-closure operator ...
B. P. Ilyin, V.I. Panteleev
doaj +1 more source
Formalisation de l’égalité empirique de deux grandeurs – Applications
Philosophia ScientiæThe mathematical discourse on empirical equalities systematically uses the figure of equality in “abstract spaces” adapted to each case. Instead of these “ascents into ontology”, we prefer an enrichment of the formal language that can precisely convey ...
Yves Péraire
doaj +1 more source
Proof-irrelevant model of CC with predicative induction and judgmental equality [PDF]
Logical Methods in Computer Science, 2011 We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's trace encoding which is universally defined for any function type, regardless of being impredicative.
Gyesik Lee, Benjamin Werner
openaire +4 more sources
Order-Sorted Equality Enrichments Modulo Axioms [PDF]
, 2015 Built-in equality and inequality predicates based on comparison of canonical forms in algebraic specifications are frequently used because they are handy and efficient.
Gutiérrez Gil, Raúl +2 more
core +1 more source
A Note on Logic Programming Fixed-Point Semantics [PDF]
, 1993 In this paper, we present an account of classical Logic Programming fixed-point semantics in terms of two standard categorical constructions in which the least Herbrand model is characterized by properties of universality.
Sassone, V.
core
A note on generalized generalization
Acta Universitatis Carolinae Philosophica et HistoricaThe generalization rules of sequent calculi allow, under some restrictions, to derive a formula ∃χφ or ∀χφ from a formula φχ (γ), i.e. from the formula obtained by substituting a variable γ for all free occurrences of χ in φ.
Vítězslav Švejdar
doaj +1 more source
IBN SĪNĀ'S APPROACH TO EQUALITY AND UNITY [PDF]
, 2017 Aristotle did not develop the quantification of the predicate, but, as shown in a recent paper by Hasnawi, Ibn Sīnā did. In fact, assuming the Aristotelian subject-predicate structure, Ibn Sīnā qualifies those propositions that carry a quantified ...
Granström, Johan Georg +2 more
core
Checking Chase Termination over Ontologies of Existential Rules with Equality [PDF]
, 2020 The chase is a sound and complete algorithm for conjunctive query answering over ontologies of existential rules with equality. To enable its effective use, we can apply acyclicity notions; that is, sufficient conditions that guarantee chase termination.
Urbani, Jacopo, Carral, David
core +1 more source
Social Network Rumor Diffusion Predication Based on Equal Responsibility Game Model [PDF]
IEEE Access, 2019 Because billions of mobile phones build a bridge between mobile sensor networks and social networks, the content of a rumor is diffused faster than ever. Therefore, rumor diffusion becomes an important issue in those two networks and how to predicate rumor diffusion becomes more important in handling rumors when they cause a little impact at the ...
Dazhen Lin +5 more
openaire +2 more sources
Decidability of Program Verification Can Be Achieved by Replacing the Equality Predicate by the "constructive" One [PDF]
, 1999 . In this paper a specification language for sequential file processing is defined. For a rich subset of this language the decidability of the program verification problem is proved.The crucial point is the introduction of "constructive " ...
Mikhail Auguston
core