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”

Filters

90 520 (0,242s)

Result

Standard Completeness for Uninorm-Based Logics

We provide a uniform proof of standard completeness for a large class of axiomatic extensions of Uninorm Logic.

BA - Obecná matematika

  • 2015
  • D
  • Link
Result

On the Failure of Standard Completeness in PiMTL for Infinite Theories

It is well-known that Hájek's Basic Fuzzy Logic (BL), Lukasiewicz logic, and product logic are not strongly standard complete. On the other hand Esteva and Godo's standard complete. In this paper we show that PiMTL...

BA - Obecná matematika

  • 2007
  • Jx
Result

Alternative Proof of Standard Completeness Theorem for MTL

In this paper we present a different proof of the standard completeness theorem for the monoidal t-norm based logic. In fact, we prove even more since we show that MTL is complete w.r.t. the class of standard MTL-a...

BA - Obecná matematika

  • 2007
  • Jx
Result

A Note on the First-Order Logic of Complete BL-Chains

We show that a complete BL-chain satisfies all standard BL-tautologies iff it satisfies a certain transfinite condition (infinite infimum commutes with squaring)....

BA - Obecná matematika

  • 2008
  • Jx
Result

On Strong Standard Completeness in Some MTL-Delta Expansions

with infinitary rules) which is strongly complete with respect to the standard algebra [0,1 axiomatizations for standard BL-algebras, we focus on a uniform approach to the following–Titani density rule. Then we show that L...

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

  • 2017
  • Jimp
  • Link
Result

On the Complexity of Propositional Logics with an Involutive Negation.

Let C be the propositional calculus given by a standard SBL-algebra; C~ is obtained from C by adding an involutive negation with axioms and deduction rules. Then C~ is coNP-complete....

BA - Obecná matematika

  • 2003
  • D
Result

Densification of FL Chains via Residuated Frames

a uniform proof for many of the known densification and standard completeness results are standard complete. Our method also applies to (possibly non-integral) commutative FL algebraic proof to the standard

BA - Obecná matematika

  • 2016
  • Jx
  • Link
Result

Research report - CellSELect

*Main goals of the first phase completed: working protocols, complete documentation for experimental work with stem cells, standard operational procedures, preparation of comparative study....

FJ - Chirurgie včetně transplantologie

  • 2012
  • O
Result

The C and C++ Programming Languages - The Complete Pocket Guide

This book is a complete reference guide to the C and C++ programming languages according to the intenational standards ISO 9899:1999 and ISO14882:2003. The news according to the prepared new standard known as C++0x are cove...

JC - Počítačový hardware a software

  • 2011
  • O
Result

ČSN 73 4001 Accessibility and barrier-free use

A binding technical standard as part of the Building Act. This is a binding standard for Decree No. 146/2024 Coll. on requirements for construction. The standard and transport infrastructure buildings, changes to the plan b...

Transport engineering

  • 2024
  • Hleg
  • Link
  • 1 - 10 out of 90 520