Implicit completeness criterion in three-valued logic in terms of maximal classes

03/30/2021
by   Mikhail Starostin, et al.
0

Implicit expressability was introduced by A.V. Kuznetsov in 1979 as generalization of functional expressability. Set of functions is called implicitly complete if any function has an implicit representation over this set. The system of all implicitly maximal classes in three-valued logic is described. The implicit completeness criterion is stated.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2020

On Coalgebraic Many-Valued Modal Logic

In this paper, we investigate the many-valued version of coalgebraic mod...
research
02/23/2018

Implicit definability of truth constants in Łukasiewicz logic

In the framework of propositional Łukasiewicz logic, a suitable notion o...
research
03/25/2020

Two almost-circles, and two real ones

Implicit locus equations in GeoGebra allow the user to do experiments wi...
research
10/23/2020

An algebraic study of the first order version of some implicational fragments of the three-valued Lukasiewicz logic

MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-alge...
research
05/20/2022

General Ramified Recurrence and Polynomial-time Completeness

We exhibit a sound and complete implicit-complexity formalism for functi...
research
06/16/2019

Pi-surfaces: products of implicit surfaces towards constructive composition of 3D objects

Implicit functions provide a fundamental basis to model 3D objects, no m...
research
12/17/2022

Just Testing

The concept of must testing is naturally parametrised with a chosen comp...

Please sign up or login with your details

Forgot password? Click here to reset