We investigate the expressive power relative to three-valued and four-valued logics of various subsets of the set of connectives which are used in the bilattices-based logics. Our study of a language is done in two stages. In the rst stage the ability of the language to characterize sets of tuples of truth-values is determined. In the second stage the results of the rst are used to determine it...

Computability logic is a formal theory of computational tasks and resources. Formulas in it represent interactive computational problems, and “truth” is understood as algorithmic solvability. Interactive computational problems, in turn, are defined as a certain sort games between a machine and its environment, with logical operators standing for operations on such games. Within the ambitious pr...

The recently initiated approach called computability logic is a formal theory of interactive computation. It understands computational problems as games played by a machine against the environment, and uses logical formalism to describe valid principles of computability, with formulas representing computational problems and logical operators standing for operations on computational problems. Th...

everyone looks unsightly at the human, who has been created from feeble sperm he will prostrate to great creator who has created everything with the finest stature. the holy qur'an has encouraged the fair and conscientious seekers of truth to meditate on the quality of human creation, creation of body limbs and recognition of his innovations. the hand is one of the body limbs, be used in d...

This work describes a methodology that combines logic-based systems and connectionist systems. Our approach uses finite truth-valued Lukasiewicz logic, wherein every connective can be defined by a neuron in an artificial network [1]. This allowed the injection of first-order formulas into a network architecture, and also simplified symbolic rule extraction. For that we trained a neural networks...