Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

We formalize a local model checker in rewriting logic and use it to analyze an infinite-state system in this paper. In order not to pursue infinite computation path endlessly, we perform bounded proof search on the system. Inconclusive proofs occurred in the bounded search are formalized by introducing three-valued logic in our local model checker. We therefore demonstrate how to use rewriting ...

A general procedure is presented for producing classic-like cut-based tableau systems for finite-valued logics. In such systems, cut is the only branching rule, and formulas are accompanied by signs acting as syntactic proxies for the two classical truth-values. The systems produced are guaranteed to be sound, complete and analytic, and they are also seen to polinomially simulate the truth-tabl...

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

This paper describes a probabilistic method for verifying the equivalence of two multiple-valued functions. Each function is hashed to an integer code by transforming it to a integer-valued polynomial and the equivalence of two polynomials is checked probabilistically. The hash codes for two equivalent functions are always the same. Thus, the equivalence of two functions can be verified with a ...

abstract. let x be a vector space over a field k of real or complex numbers.we will prove the superstability of the following golab-schinzel type equationf(x + g(x)y) = f(x)f(y); x; y 2 x;where f; g are unknown functions (satisfying some assumptions). then we generalize the superstability result for this equation with values in the field of complex numbers to the case of an arbitrary hilbert spac...

Interval-valued intuitionistic fuzzy sets (IVIFSs) are widely used to handle uncertainty and imprecision in decision making. However, in more complicated environment, it is difficult to express the uncertain information by an IVIFS with considering the decision-making preference. Hence, this paper proposes a group generalized interval-valued intuitionistic fuzzy soft set (G-GIVIFSS) which conta...

The interval-valued intuitionistic fuzzy set (IVIFS) which is an extension of the Atanassov’s intuitionistic fuzzy set is a powerful tool for modeling real life decision making problems. In this paper, we propose the emph{generalized interval-valued intuitionistic fuzzy Hamacher generalized Shapley Choquet integral} (GIVIFHGSCI) and the emph{interval-valued intuitionistic fuzzy Hamacher general...

data envelopment analysis (dea) has been widely studied in the literature since its inception with charnes, cooper and rhodes work in 1978. the methodology behind the classical dea method is to determine how much improvements in the outputs (inputs) dimensions is necessary in order to render them efficient. one of the underlying assumptions of this methodology is that the units consume and prod...

In this expository lecture, we explain how problems of classical polynomial algebra may be understood and numerically solved when they appear in the context of Scientific Computing, i.e. with data of limited accuracy. A suitable conceptual framework is introduced and its use explained in a number of situations.