All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”
EN
ČeštinaEnglish

Filters

2 831 (0,142s) •

Result

Rees Coextensions of Finite, Negative Tomonoids

A totally ordered monoid, or tomonoid for short, is a monoid endowed with a compatible total order. We deal in this article with tomonoids that are finite. By a Rees coextension of a negative tomonoid S, we mean a negative ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
    • •
  • Jimp
    • •
  • Link
Result

The Semantics of Fuzzy Logics: Two Approaches to Finite Tomonoids

Fuzzy logic generalises classical logic; in addition to the latter?s truth values "false" and "true", the former allows also intermediary truth degrees. The conjunction is, accordingly, interpreted by an operation acting on a chain, making the set of...

BA - Obecná matematika

  • 2016
    • •
  • C
    • •
  • Link
Result

Algorithm for Generating Finite Totally Ordered Monoids

The semantics of fuzzy logic is typically based on negative totally ordered monoids. This contribution describes an algorithm generating in a step-wise fashion all finite structures of this kind....

BA - Obecná matematika

  • 2016
    • •
  • D
    • •
  • Link
Result

Rees Coextensions of Finite Tomonoids and Free Pomonoids

A totally ordered monoid, or tomonoid for short, is a monoid endowed with a compatible total order. We reconsider in this paper the problem of describing the one-element Rees coextensions of a finite, negative tomonoid S, that is, t...

Pure mathematics

  • 2019
    • •
  • Jimp
    • •
  • Link
Result

Algorithm to Generate the Archimedean, Finite, Negative Tomonoids

We study Archimedean, finite, negative totally ordered monoids. We describe an algorithm which generate the structures of this type in a step-wise fashion. Our approach benefits from the level set representation of monoids and is inspired by web geom...

BA - Obecná matematika

  • 2014
    • •
  • D
    • •
  • Link
Result

Partitivity

The notion partitivity already appears in the Indo European declination s system in the genitive form with the partitive sense. During the divergent evolution and the partitive genitive is replaced by the periphrastic locus...

AI - Jazykověda

  • 2004
    • •
  • Jx
Result

Modelling of strain partitioning in transpression zones

Two models of strain partitioning in ductile transpressional zones derived that are called here ductile strain partitioning and viscosity partitioning....

DB - Geologie a mineralogie

  • 1999
    • •
  • C
Result

Path partitions of hypercubes

We study partitions of hypercubes into paths with prescribed endvertices. We improve previously known results on the number of paths in such partitions....

BA - Obecná matematika

  • 2008
    • •
  • Jx
Result

Fine partitioning of 2-connected components using Fiedler vector

In this paper we propose usage of 2-connected components as coarse granulity partition and spectral partitioning method as a fine partitioning of selected components....

IN - Informatika

  • 2009
    • •
  • D
Result

Counting even and odd partitions

Enumerative results on set partitions.

BA - Obecná matematika

  • 2003
    • •
  • Jx
  • 1 - 10 out of 2 831