A functional computation model for the duality of two-variable Lambda-Boolean functions

This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on this model. With respect to this aim, some definitions and theorems which construct the model of the two-variable Lambda-Bo...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation 2006-11, Vol.182 (1), p.879-887
Main Authors: GÜYER, Tolga, MIRASYEDIOGLU, Seref
Format: Article
Language:English
Subjects:
Boolean functions
Combinatorics. Ordered structures
Duality
Exact sciences and technology
General logic
Lambda-Boolean functions
Lambda-Calculus
Logic and foundations
Mathematical logic, foundations, set theory
Mathematics
Methods of scientific computing (including symbolic computation, algebraic computation)
Numerical analysis
Numerical analysis. Scientific computation
Order, lattices, ordered algebraic structures
Prolog
Sciences and techniques of general use
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on this model. With respect to this aim, some definitions and theorems which construct the model of the two-variable Lambda-Boolean functions are given. The simulation of the model is implemented in the programming language Prolog, and the whole code is given as an extended and revised version of the implementation in [Ş. Mirasyedioğlu, T. Güyer, A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG, Appl. Math. Comput. 176 (1) (2006) 65–75].
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2006.04.055