Results 61 to 70 of about 970 (166)

Parametric Closed Classes of Hyperfunctions on Two-Element Set

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2016
One of the direction in discrete function's investigations is research of functional systems: the sets of functions and the sets of operators defined on this functions.
L. Ryabets
doaj  

A survey of computable set theory

open access: yesLe Matematiche, 1988
This paper surveys various decidability results in the set theory. In the first part, we focus on certain classes of unquantified set-theoretic formulae involving the relations ∊ “membership”, = “equality”, and the operators ...
Domenico Cantone
doaj  

Proof-Guided Test Selection from First-Order Specifications with Equality [PDF]

open access: yes, 2010
International audienceThis paper deals with test case selection from axiomatic speci cations whose axioms are quanti er-free rst-order formulas with equality. We rst prove the existence of an ideal exhaustive test set to start the selection from. We then
Aiguier, Marc   +2 more
core  

First order predicate calculus and logic programming. Fourth Edition [PDF]

open access: yes, 2016
These lecture notes are intended to introduce the reader to the basic notions of the first order predicate calculus and logic programming. We present the axioms and the inference rules of the first order predicate calculus in two different styles: (i)
Pettorossi, A   +3 more
core  

Exact Probability Distribution for the ROC Area under Curve. [PDF]

open access: yesCancers (Basel), 2023
Ekström J   +2 more
europepmc   +1 more source

A Formalization of SQL with Nulls. [PDF]

open access: yesJ Autom Reason, 2022
Ricciotti W, Cheney J.
europepmc   +1 more source

Beyond Equi-joins: Ranking, Enumeration and Factorization. [PDF]

open access: yesProceedings VLDB Endowment, 2021
Tziavelis N, Gatterbauer W, Riedewald M.
europepmc   +1 more source

Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification

open access: yesJournal of Logical and Algebraic Methods in Programming
An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction; the remaining 11 can be automated as simplification rules.
openaire   +2 more sources

Home - About - Disclaimer - Privacy