Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Dedekind-MacNeille"”.

  1. ON SOME AXIOMATIC EXTENSIONS OF THE MONOIDAL T-NORM BASED LOGIC MTL: AN ANALYSIS IN THE PROPOSITIONAL AND IN THE FIRST-ORDER CASE

    … F. Montagna. Supersound many-valued logics and Dedekind-MacNeille completions. Arch. Math. Log., 48(8), 719-736, 2009. doi:10.1007/s00153-009-0145-3. [5] M. Bianchi and F. Montagna. n-contractive BL-logics. Arch. Math. Log., 2010. doi:10.1007/s00153-010-0213-8. [6] P. Cintula, F. Esteva, J. …

    milano Repository record for ON SOME AXIOMATIC EXTENSIONS OF THE MONOIDAL T-NORM BASED LOGIC MTL: AN ANALYSIS IN THE PROPOSITIONAL AND IN THE FIRST-ORDER CASE (opens in a new tab)

  2. Diamond-free partial orders

    … in the simplest case given in [5] is a 2-level Dedekind-MacNeille complete 3-cs-transitive partial order, but which here is allowed to be a partial order of greater complexity. A rich class of examples is found, which have very high degrees of homogeneity and help to answer a number of …

    whiterose Download PDF for Diamond-free partial orders (opens in a new tab)

  3. Non-symmetric completion as a topological foundation for denotational semantics, the complexity analysis of programs, and Russell-Wiener' s theory of continuous-time

    … Λ-completion unifies the classical approaches of MacNeille, Dedekind and Doitchinov into a universal framework, offering a general method for understanding and comparing completion theories. The study then applies Scott topology to program complexity analysis by introducing the measure Cov(K), …

    greece Repository record for Non-symmetric completion as a topological foundation for denotational semantics, the complexity analysis of programs, and Russell-Wiener' s theory of continuous-time (opens in a new tab)