Online Store

Geometry.Net - the online learning center
Home  - Mathematical_Logic - Post Algebras
Page 1     1-52 of 52    1 

1. The Relation Of Equivalence For Post Algebras And Its Application To Hazard-Free
The investigation encompasses the study of elementary properties of Post algebras, as well as the development of a useful theory of equivalence for elements

2. JSTOR On Post Algebras With Uncountable Chain Of Constants
DWINGER Generalized Post algebras. Ibid., vol. 1e (1968), pp. 5595e5. In the paper of Dwinger a generalized Post algebra is defined to be a distributive<188:OPAWUC>2.0.CO;2-W

3. IngentaConnect Horn Sentences In Post Algebras
If H is a Horn sentence in the language LPA of rPost algebras such that H is true on the r-Post algebra ({e0, , er - 1}, + ,., e0, , er - 1, C0,
var tcdacmd="dt";

4. Generalized Finite Post Algebras
A generalized Post algebra is defined and discussed. It is proved that generalized Post algebras are complete whereas Post algebras, other than those based

5. Uniform Degeneracy Of AOP
Based on the duality concept, in Boolean and in Post algebras, The dual operation in Boolean and Post algebras is the uniform degeneracy under the D

News Links Search ... Degeneracy
Paper-1 Paper-2 Paper-3 Paper-4
Researches GTODE
Paper-1 Paper-2 Paper-3 Paper-4
Researches Contents Definitions Priority function Priority equation Uniform Degeneracy of Prioritors ... Degeneracy of Equations See also TOC Abstract Introduction Priority ... Bibliography 2- THE UNIFORM DEGENERACY IN AOP Definitions and Notations The following AOP notation will be used in the following sections. In mathematics, we usually consider variables to be the only parameters of functions. Thus, we specify these variables in the function heading. For example, the f(x) notation means ‘x’ is a variable parameter and the f(x,y) means ‘x’ and ‘y’ are variable parameters. Because AOP is a multi-operational algebra, we extend the notation to specify variables operators and constants as parameters in the function heading and at the same time use sets notations to specify such parameters. For example, assume we have the following function in Boolean algebra G(A,B,C)= (A+B)*(A+B)+A*C+(1+C)*(B+0). In AOP, we write this as G(X, a a a ,c) notation (1) ‘x’ is the set of all variables used in the function. (2) ‘

6. LIDOS BibTeX Database File Rine_a7190-215.bib
@incollection{Epstein77, AUTHOR = {G. Epstein}, TITLE = {The Lattice Theory of Post algebras}, YEAR = 1977, BOOKTITLE = {Computer Science and
German Research Center for Artificial Intelligence GmbH
LIDOS BibTeX Database File
D. C. Rine
An Introduction to Multiple-Valued Logic G. Epstein
From Fixed to Mixed Radix G. Epstein
The Lattice Theory of Post Algebras R. C. Braddock and G. Epstein and H. Yamanaka
Multiple-Valued Logic Design and Applications in Binary Computers M. A. Breuer and G. Epstein
The Smallest Many-Valued Logic for the Treatment of Completemented and Uncomplemented Error Signals G. Epstein and A. Horn
Chain Based Lattices G. Epstein
Decisive Implication G. Epstein
Multiple-Valued Signal Processing with Limiting G. Epstein and G. Frieder and D. C. Rine
The Development of Multiple-Valued Logic as Related to Computer Science G. Epstein and A. Horn P-Algebras, an Abstraction from Post Algebras T. Traczyk Post Algebras through PO and P1 Lattices S. J. Surma An Algorithm for Axiomatizing Every Finite Logic I. G. Rosenberg Completeness Properties of Multiple-Valued Logic Algebras S. Y. H. Su and P. T. Cheung Computer Simplification of Multi-Valued Switching Functions W. R. Smith III

7. ( )
In this paper we introduce $\mathcal K$Post algebras of order $n$ as a common abstraction of several generalizations of Post algebras existing in the

8. Multivalued Binary Relations And Post Algebras
This paper deals with a multivalued extension of the concept of a binary relation on a set E. If R is such an rvalued relation on E, for every (x, y) E E2,
var sc_project=2763585; var sc_invisible=0; var sc_partition=28; var sc_security="3c678009"; var addtoLayout=0; var addtoMethod=0; var AddURL = escape(document.location.href); // this is the page's URL var AddTitle = escape(document.title); // this is the page title Advanced Search CS Search Google Search

9. Yaqub: Primal Clusters And Local Binary Algebras
This theorem subsumes Foster s results on prime fields, « groups with null, basic Post algebras, and, in addition, yields new results especially in regard

10. On Functional Systems Of The Type Of Post Algebras
On functional systems of the type of Post algebras. Authors, Zhutzin, Dou. Publication, Soviet Physics Doklady, Vol. 35, p.613. Publication Date, 07/1990
Sign on
Smithsonian/NASA ADS Physics Abstract Service
Find Similar Abstracts (with default settings below
Translate Abstract
On functional systems of the type of Post algebras Authors:

Soviet Physics Doklady, Vol. 35, p.613 Publication Date:

Bibliographic Code:
Not Available Bibtex entry for this abstract Preferred format for this abstract (see Preferences
Find Similar Abstracts:
Use: Authors Title Return: Query Results Return items starting with number Query Form Database: Astronomy Physics arXiv e-prints
Smithsonian/NASA ADS Homepage
ADS Sitemap Query Form Basic Search ... FAQ

11. Colloquium Mathematicum - Contents Of Volume 24
Coproducts of Boolean algebras and chains with applications to Post algebras R. Balbes, Ph. Dwinger Colloq. Math. 24 (1971/72), 1525

12. Lógica
Important models of real semigroups are Post algebras of order three. These algebras are the algebraic models of a threevalued logic developed by
Examples of Higher Order Randomness by Becher, Verónica Although most real numbers (in the sense of measure theory) are "random", to provide examples has not been easy. According to the theory of program size, a sequence is random if its prefixes have essentially the same size as the computer programs needed to generate them. In 1975 G. Chaitin gave a specific example of a random real: Omega, the probability that a universal self-delimiting machine eventually halts.
We define alpha to be the probability that a universal self-delimiting machine that never halts outputs finitely many symbols. We prove that alpha is more random than Omega. Instead, alpha is exactly as random as the halting probability of a machine equipped with an oracle for the halting problem, in spite of the fact that alpha is defined without considering oracles. The finite embeddability property for some residuated structures by Blok, Willem A class of algebras has the finite embeddability property (FEP) if every finite partial subalgebra of an algebra in the class can be embedded in a finite algebra in the class. We investigate the relationship of the FEP with the finite model property (FMP) and strong finite model property (SFMP). For quasivarieties the FEP and the SFMP are equivalent, and for quasivarieties with

13. The Theory Of The Modified Post Algebras And Multidimensional Automata Structure
The Theory of the Modified Post algebras and Multidimensional Automata Structures. GE Tseytlin. Journal Title Mathematical Foundations of Computer Science

14. Publications Of Alfred Horn
Palgebras, an abstraction from Post algebras. Algebra Universalis, 4 (1974), 195-206. Reprinted in David C. Rine (ed.).
Publications of Alfred Horn
  • A. Horn. The assymptotic behaviour of solutions of Volterra integral equations. Trans. Amer. Math. Soc. A. Horn, A. Tarski. Measures in Boolean algebras. Trans. Amer. Math. Soc. J. L. Hodges Jr., A. Horn. On Maharam's conditions for measure. Trans. Amer. Math. Soc. A. Horn, F. A. Valentine. Some properties of L sets in the plane. Duke Math. Journal A. Horn. Some generalizations of Helly's theorem on convex sets. Bull. Amer. Math. Soc. A. Horn. On the singular values of a product of completely continuous operators. Proc. Nat. Acad. Sci. USA A. Horn. On sentences which are true of direct unions of algebras. Journal Symb. Logic A. Horn. The normal completion of a subset of a complete lattice and lattices of continuous functions. Pacific Journal Math. A. Horn. On the eigenvalues of a matrix with prescribed singular values. Proc. Amer. Math. Soc. A. Horn. Doubly stochastic matrices and the diagonal of a rotation matrix. Amer. Journal Math. A. Horn. A characterization of unions of linearly independent sets. Journal London Math. Soc.

15. MSC 2000 : CC = Algebras
06D20 Heyting algebras See also 03G25; 06D25 Post algebras See also 06D72 Fuzzy lattices (soft algebras) and related topics Nouveau code MSC 2000

16. 1. Plain Semi-Post Algebras
The notion of Post algebra was introduced in Rosenbloom (1942). In Rousseau (1969, 1970) an equivalent formulation of the class of Post algebras was given
POST ALGEBRAS AND POST LOGICS Ewa Orlowska Institute of Telecommunications, Warsaw Emil Post doctoral dissertation Post (1921) contained a description of an n-valued, functionally complete algebra, for a finite n 2. The notion of Post algebra was introduced in Rosenbloom (1942). In Rousseau (1969, 1970) an equivalent formulation of the class of Post algebras was given which became a starting point for extensive research. Since then various generalisations of Post algebras inspired by applications in computer science have been developed. This note in a brief survey of major classes of Post algebras. 1. Plain semi-Post algebras These algebras were introduced and investigated in Cat Ho (1973), Cat Ho and Rasiowa (1987, 1989, 1992). Let (T, ) be a poset and let ET be the set of ideals of T together with the empty set . Clearly, T ET. It is known that any s ET is of the form s= T: w ) is a complete lattice, where join and meet are set-theoretical union and intersection, respectively. An abstract algebra (P) P =(P

17. Mathematical Structures: HomePage
If you are familiar with some of these classes of algebras, feel .. Posets Pointed residuated lattices; Post algebras?

18. DBLP: Antoni Torrens
2, Antoni Torrens Cyclic Elements in MValgebras and Post algebras. Math. Log. Q. 40 431-444 (1994). 1 Antonio J. Rodríguez Salas, Antoni Torrens
Antoni Torrens
List of publications from the DBLP Bibliography Server FAQ Coauthor Index - Ask others: ACM DL Guide CiteSeer CSB ... Joan Gispert , Antoni Torrens: Bounded BCK-algebras and their generated variety. Math. Log. Q. 53 EE Josep Maria Font , Antoni Torrens, : On the infinite-valued Lukasiewicz logic that preserves degrees of truth. Arch. Math. Log. 45 EE Roberto Cignoli , Antoni Torrens: Free Algebras in Varieties of Glivenko MTL-algebras Satisfying the Equation 2(x Studia Logica 83 EE Roberto Cignoli Soft Comput. 9 ... Joan Gispert , Antoni Torrens: Axiomatic Extensions of IMT3 Logic. Studia Logica 81 EE Roberto Cignoli , Antoni Torrens: Glivenko like theorems in natural expansions of BCK-logic. Math. Log. Q. 50 EE Roberto Cignoli Arch. Math. Log. 42 ... Roberto Cignoli , Antoni Torrens: Free Stone algebras. Discrete Mathematics 222 EE Roberto Cignoli Francesc Esteva ... Lluis Godo , Antoni Torrens: Basic Fuzzy Logic is the logic of continuous t-norms and their residua. Soft Comput. 4 Joan Gispert , Antoni Torrens: Quasivarieties Generated by Simple MV-algebras. Studia Logica 61 , Antoni Torrens, : On Gentzen Systems Associated with the Finite Linear MV-Algebras.

19. Sachgebiete Der AMS-Klassifikation: 00-09
in this section 03Dxx Recursion theory 03D03 Thue and Post systems, etc. polyadic algebras; relation algebras 03G20 Lukasiewicz and Post algebras,
Sachgebiete der AMS-Klassifikation: 00-09
nach 90-99 Weiter nach 10-19 Suche in allen Klassifikationen
01-XX 03-XX 04-XX 05-XX 06-XX 08-XX
nach 90-99 Weiter nach 10-19 Suche in allen Klassifikationen

20. List KWIC DDC22 510 And MSC+ZDM E-N Lexical Connection
positive solutions of nonlinear boundary value problems 34B18 Post algebras 06D25 Post algebras Lukasiewicz and 03G20 Post systems, etc. Thue and 03D03
polynomials (irreducibility, etc.)
polynomials (irreducibility, etc.)
polynomials and functions # other special orthogonal
polynomials and functions (Askey - Wilson polynomials, etc.) # basic orthogonal
polynomials and functions associated with root systems # orthogonal
polynomials and functions associated with root systems (Macdonald polynomials, etc.) # basic orthogonal
polynomials and functions in several variables expressible in terms of basic hypergeometric functions in one variable # orthogonal
polynomials and functions in several variables expressible in terms of special functions in one varaible # orthogonal
polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) # orthogonal
polynomials and generalizations # Fibonacci and Lucas numbers and
polynomials and generalizations # small fractional parts of polynomials and matrices polynomials over commutative rings polynomials, etc.) # basic orthogonal polynomials and functions (Askey - Wilson polynomials, etc.) # basic orthogonal polynomials and functions associated with root systems (Macdonald

21. [Rud00] On Identities And Equations In Post Algebras
Title, « On identities and equations in Post algebras ». Journal, Bul. Acad. tiin e Repub. Mold. Mat. Number, 2. Page(s), 314, 99, 101
Overview Tree Index Bibliography PREV NEXT FRAMES NO FRAME
[Rud00] On identities and equations in Post algebras
Rud:00b (Article) Author(s) Rudeanu, Sergiu Title Journal Number Page(s) Year BibTeX code Overview Tree Index Bibliography PREV NEXT FRAMES NO FRAME Submit a bug This document was generated by
Stephane GALLAND
(under the GNU General Public License

22. The Theory Of The Modified Post Algebras And Multidimensional
The Theory of the Modified Post algebras and Multidimensional Automata Structures. Resource URI http//

23. Helena Rasiowa
The study of the relationship between logic and algebra, originated by the especially on applications of various generalizations of Post algebras to
Biographies of W omen Mathematicians
Home Alphabetical Index Chronological Index Resources ... Search
Helena Rasiowa
June 20, 1917 - August 9, 1994 Based on the article "Helena Rasiowa, 1917-1994" by W. Bartol, E. Orlowska, and A. Skowron from the Bulletin of the European Association for Theoretical Computer Science , Vol. 62 (1997), 353-366. Reprinted with permission of the EATCS.
Elements of a biography
Helena Rasiowa, mathematician and logician, passed away on August 9, 1994. Her influence on the shape of mathematical logic can hardly be overestimated. She was born in Vienna on June 20, 1917 to very patriotic Polish parents. As soon as Poland had regained its independence in 1918 after more than a century of partitioned stateless existence, the whole family settled in Warsaw. Helena's father was a high-class railway specialist; his knowledge and experience in the field led him to assume very important positions in the railway administration. The girl, her parents' only child, had good conditions to grow up physically and mentally. And, indeed, she exhibited many different skills and interests, varying from music, which she was learning at a music school parallel to her normal studies in a secondary school, to business management, which she studied for more than a semester after completing her secondary education. But finally the most important of her interests, as the future was to prove, took the lead. In 1938 the time was not very propitious for entering a university. Even if not many in Europe were convinced that war was inevitable, the next year was to prove how mistaken those of the majority were. Rasiowa had to interrupt her studies, for no legal education was possible in Poland after 1939. Many people fled the country, or at least they fled the big towns which were more subject to German bombardments and terror. So did the Ras family, also because of the fact that most high-ranking administration officials and members of the government were being evacuated to Romania. The Ras's spent a year in Lvov. After the Soviet invasion in September 1939 the town was taken over by the Soviet Union. The life of many Poles became endangered, so eventually the father decided to return to Warsaw.

24. Logic And Computer Vol.4
LukasiewiczMoisil algebras. Intuitionistic implication. algebras corresponding propositional calculus Ln. Lukasiewicz’s n-valued implication. Post algebras

25. Springer Online Reference Works
The lattice of Post algebras with respect to inclusion (cf. Post algebra). This text originally appeared in Encyclopaedia of Mathematics ISBN 1402006098

Encyclopaedia of Mathematics
Article refers to

Post lattice
The lattice of Post algebras with respect to inclusion (cf. Post algebra This text originally appeared in Encyclopaedia of Mathematics - ISBN 1402006098

26. List KWIC DDC And MSC Lexical Connection
Post algebras Lukasiewicz and 03G20 Post systems, etc. Thue and 03D03 Postnikov systems, $k$invariants 55S45 potential electric charge and 537.21
piezoelectricity, ferroelectricity
pivoting methods # extreme-point and
PL-structures: classification, Hauptvermutung # comparison of
PL-topology # equivariant
placement problems # pole and zero
planar arrangements of lines and pseudolines
Planck, Langevin, etc.) # stochastic methods (Fokker -
plane # capacity and harmonic measure in the complex
plane # quasiconformal mappings in the plane analitic geometry plane analysis, limit cycles # phase plane and space curves plane and surfaces # homeomorphism and diffeomorphisms of plane geometry plane trigonometry planes planes # absolute planes # affine and projective planes # curves and surfaces on projective and affine planes # finite upper-half planes # non-Desarguesian affine and projective planes and spreads # translation planetary atmospheres planning # educational research and planning aids # teacher manuals and plant biology plasma physics plasmas plasmic flow # ionized gas flow in electromagnetic fields; plastic materials, materials of stress-rate and internal-variable type plasticity plateau # Mesopotamia and iranian plates platonism and neoplatonism # modern players # games with infinitely many pluralism # dualism and pluricomplex Green functions pluriharmonic and plurisubharmonic functions pluripotential theory pluripotential theory plurisubharmonic exhaustion functions plurisubharmonic functions # pluriharmonic and plurisubharmonic functions and generalizations plus-constructions # Q$- and point # motion of a rigid body with a fixed

27. Mathematica Japonica ( Vol.48 NO.2 / 1998 ) $\mathcal K
Translate this page Distributive lattices, Bollean algebras, Post algebras, Lukasiewicz algebras, Quantifiers, Monadic algebras, Free algebras

28. Atlas: A Determination Principle For The Algebras Of The $n$-valued Lukasiewicz
The nvalued Lukasiewicz-Moisil algebras, MV-algebras and Post algebras are structures developed in connection to the algebra of the n-valued Lukasiewicz
Atlas home Conferences Abstracts about Atlas 75th Workshop on General Algebra: AAA75+CYA23
November 2-4, 2007
Darmstadt University of Technology (TU Darmstadt)
Darmstadt, Hessen, Germany Organizers
Prof. Dr. Rudolf Wille, Prof. Dr. Peter Burmeister, Prof. Dr. Karl-Erich Wolff View Abstracts
Conference Homepage
A determination principle for the algebras of the n-valued Lukasiewicz logic
Ioana Leustean
The n-valued Lukasiewicz-Moisil algebras, MV-algebras and Post algebras are structures developed in connection to the algebra of the n-valued Lukasiewicz logic. If an algebra A belongs to one of the above classes, then we shall define a sequence of n Boolean ideals J (A), ..., J n (A), such that the following determination principle is satisfied: A =A iff J i (A )=J i (A ) for any i=1, ..., n. As an application, we shall prove that A is s -complete if and only if the corresponding ideals are s -closed. Date received: September 28, 2007 Atlas Conferences Inc. Document # caux-28.

Chapter five gives applications to problems of error correcting codes, graphs, sequential machines, and a generalization to Post algebras.
THE UNIVERSITY OF MICHIGAN COLLEGE OF ENGINEERING Department of Electrical Engineering Information Systems Laboratory Interim Engineering Report COMBINATORIAL PROBLEMS IN BOOLEAN ALGEBRAS AND APPLICATIONS TO THE THEORY OF SWITCHING Michael A. Harrison ORA Project 04879 under contract with: UNITED STATES AIR FORCE AERONAUTICAL SYSTEMS DIVISION CONTRACT: NO. AF 33(657) -7811 WRIGHT-PATTERSON AIR FORCE BASE, OHIO administered through: OFFICE OF RESEARCH ADMINISTRATION ANN ARBOR June 1963 This report was also a dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in The University of Michigan, 1963. TABLE OF CONTENTS Page LIST OF TABLES............................ iv LIST OF ILLUSTRATIONS..........................vii LIST OF APPENDICES........................... viii ABSTRACT................................ ix CHAPTER I. INTRODUCTION AND HISTORY...........1 1 II. MATHEMATICAL BACKGROUND.................... 4 III. SWITCHING FUNCTIONS AND PERMUTATION GROUPS...........30 IV. EXTENTIONS OF EQUIVALENCE OF BOOLEAN FUNCTIONS.......... 73 V. APPLICATIONS................ o...108 VI. UNSOLVED PROBLEMS................... 127 APPENDICES............................... 129 BIBLIOGRAPHY.......................... o o 139 iii LIST OF ILLUSTRATIONS Figure Page I. Two networks which are equivalent under...... 5 II. Two networks which are equivalent under 3......... 41 III. The lattice of interesting subgroups of ~n(Z2).......72 IV. A generic (n,k) network................... 81 V. The effect of a = (2,3) on a (3,4) network.........82 VI. The absolutely minimal network for Xx2x3 + x2x3......109 vii

30. 06Dxx
06D25 Post algebras See also 03G20; 06D30 De Morgan algebras, Lukasiewicz algebras See 06D72 Fuzzy lattices (soft algebras) and related topics
Home MathSciNet Journals Books ...
Contact Us
201 Charles Street
Providence, RI 02904
USA Phone: 401-455-4000
or 800-321-4AMS Or email us at Open Positions
Distributive lattices
  • 06D05 Structure and representation theory 06D10 Complete distributivity 06D15 Pseudocomplemented lattices 06D20 Heyting algebras [See also 54-xx 06D25 Post algebras [See also 06D30 De Morgan algebras, Lukasiewicz algebras [See also 06D35 MV-algebras 06D50 Lattices and duality 06D72 Fuzzy lattices (soft algebras) and related topics 06D99 None of the above, but in this section

Privacy Statement

, American Mathematical Society

31. Post Algebras And Rings
Post algebras and rings. Other data used to describe and catalog the resource. Author. Wade, LI. Date Published. 194506 (Issued). Resource Format
Skip to Main Content Skip to Footer Links This resource was selected by the National Science Digital Library. Search for more NSDL resources Return to top of the page View this resource in its own window View more information about this resource This resource is found in the following collection(s). Click on the collection logo for more information. Close this window
Collection Name: Project Euclid: A partnership of independent publishers of mathematics and statistics journals. Collection Description: Project Euclid's mission is to advance scholarly communication in the field of theoretical and applied mathematics and statistics. Project Euclid is designed to address the unique needs of low-cost independent and society journals. Through a collaborative partnership arrangement, these publishers join forces and participate in an online presence with advanced functionality, without sacrificing their intellectual or economic independence or commitment to low subscription prices. Full-text searching, reference linking, interoperability through the Open Archives Initiative, and long-term retention of data are all important components of the project. The end result is a vibrant online information community for independent and society journals. This will assure that mathematics and statistics will continue to benefit from a healthy balance of commercial enterprises, scholarly societies, and independent publishers. Subject(s): MathematicsPeriodicals
Collection Information: Title

32. The Visual Basic Team : Higher Algebra With Operator Overloads (Brian Beckman)
I thought I d follow up with a Post explaining the details of exactly what. Lie algebras, and Some of Their Applications, by Robert Gilmore
The Visual Basic Team
A group blog from members of the VB team Visual Basic Developer Center How-Do-I Videos Power Packs Code Samples ... Team Webcasts
Higher Algebra with Operator Overloads (Brian Beckman)
Published 19 December 07 08:00 AM Recently I did a Channel 9 interview with Beth Massi where I walked through a Visual Basic program that used Generics and Operator overloads to perform some higher mathematics. I thought I'd follow up with a post explaining the details of exactly what I did. Operator overloads with Generics enable some beautiful designs for data types in Higher Algebra, a branch of mathematics, sometimes called Abstract Algebra. Consider fields and vector spaces I'll show you operator overloads at THREE levels in a single design. First, background: In this context, a "field" is a collection of unspecified objects, closed under two associative operators, + and *, that obey the distributive law. Closed means that for any a, b, and c in the field, a+b and a*c are in the field. Associative means a + (b + c) = (a + b) + c a * (b * c) = (a * b) * c Distributive means a * (b + c) = a * b + a * c (b + c) * a = b * a + c * a The field must also have two special members: the additive unit and the multiplicative unit 1, where

33. RasiowaMFCS.htm
They include generalizations of Post algebras, among them semiPost algebras (84) and the The paper 84 introduces a generalization of Post algebras,
HELENA RASIOWA, 1917 - 1994 by Mathematical Foundations of Computer Science Fundamenta Informaticae The form of this short article makes difficult a complete presentation of her achievements in the field of applications of logical and algebraic methods in computer science. She is the author of more then 30 papers, two lecture notes ([63], [72]) and an unfinished monograph in which she relates algebraic methods of non-classical logics with applications in the foundations of computer science. She was able to write eight chapters before she was taken to hospital. Her contribution to theoretical computer science stems from her conviction that there are deep relations between methods of algebra and logic on one side and essential problems of foundations of computer science on the other. Among these problems she clearly distinguished inference methods characteristic of computer science and its applications. This conviction of hers had been supported by her results on many-valued and nonclassical logics, especially on applications of various generalizations of Post algebras to logics of programs and approximation logics. Her investigations on logic and algebraic methods in computer science can be divided into two main streams. The first includes many-valued algorithmic logics and their applications to investigation of programs ([42-44], [51], [53-64], [69-72]), while the second is concerned with approximation logics in their relation with generalizations of Post algebras ([73-97]).

34. 29th IEEE International Symposium On Multiple-Valued-Logic 1999
Chair Symposium CoChair Workshop on Post-Binary ULSI Systems Wednesday, 1030 - 1100 Multivalued Binary Relations and Post algebras M. Serfati,
29th IEEE International Symposium on Multiple-Valued-Logic 1999 Freiburg im Breisgau Germany 20-22 May 1999 PROGRAM Location Institute of Computer Science Albert-Ludwigs-University Freiburg Building 101 Am Flughafen 17 79110 Freiburg, Germany Organizing Committee Rolf Drechsler, Symposium Chair Bernd Becker, Symposium Co-Chair Nicole Drechsler, Financial Chair Frank Schmiedle, Publication Chair Christoph Scholl, Local Arrangement Chair Institute of Computer Science Albert-Ludwigs-University, Freiburg, Germany Program Chairs Elena Dubrova, Program Chair Europe/Africa Royal Institute of Technology, Sweden Michael Miller, Program Chair Americas University of Victoria, Canada Takahiro Hanyu, Program Chair Asia/Pacific Tohoku University, Japan Sponsors We wish to thank the following for their contribution to the success of this conference: IEEE Computer Society. Albert-Ludwigs-University of Freiburg, Germany. Technical Committee on Multiple-Valued Logic. European Office of Aerospace Research and Development. Air Force Office of Scientific Research. United States Air Force Research Laboratory. Activities Wednesday May 19 ULSI Workshop Conference registration Welcome reception Thursday May 20 Conference registration Technical sessions of ISMVL 99 Welcome reception in Freiburg Friday May 21 Technical sessions of ISMVL 99 Organo concert (Freiburger Muenster) Conference banquet Saturday May 22 Technical sessions of ISMVL 99 Welcome to ISMVL 99 Welcome to Freiburg im Breisgau, the site of the 29th International Symposium on Multiple-Valued Logic. Freiburg is a period middle-ages city founded by the Dukes of Zaehringen (the right to hold markets was granted in 1120 A.D.). Its historical development was especially influenced by its more than 400- year-long association with the Habsburg Dynasty. The city developed from a walled middle-ages market town to a fort city (17th/18th century) to the present-day modern city of about 200,000 inhabitants. It is the first time that the symposium is being held in Germany. Like in the past years researchers from different areas discuss the latest results in the field of multiple- valued logic. The symposium is co-sponsored by the Albert- Ludwigs-University, Freiburg, the IEEE Computer Society, the Japan Research Group on Multiple-Valued Logic (JRG-MVL), and the European Office of Aerospace Research and Development (EOARD). We wish to express our gratitude to the Symposium Committee for their hard work in preparing this event. Dr. Elena Dubrova served as a Program Chair for Europe and Africa, Prof. Takahiro Hanyu served as a Program Chair for Asia and Australia, and Prof. Michael Miller served as a Program Chair for the Americas. We would like to thank them for organizing an excellent program. ISMVL'99 has been the joint effort of many people. We especially like to thank Nicole Drechsler (Financial Chair), Frank Schmiedle (Publication Chair), and Dr. Christoph Scholl (Local Arrangement Chair). Finally, we would like to wish all participants a beautiful time in Freiburg and the black forest area and hope that we will have many stimulating discussions. Rolf Drechsler Bernd Becker Symposium Chair Symposium Co-Chair Workshop on Post-Binary ULSI Systems Wednesday, 19 May 10:00 - 10:20 Registration 10:20 - 10:30 Opening remarks Room 00-036 T. Waho, Workshop Organizer Session 1: Invited Talks Room 00-036 Chair: G. Gulak 10:30 - 11:15 Innovation of Intelligent Integrated Systems Architecture -Future Challenge M. Kameyama, Tohoku University, Japan 11:15 - 12:00 Quantum Electronic Circuit Concepts by Nanometric Technology H. Hartnagel, Technical University of Darmstadt, Germany 12:00 - 13:00 Lunch Session 2: Nanoelectronics Room 00-036 Chair: T. Waho 13:00 - 13:20 High-Speed Single-Electron Memory and Logic H. Mizuta, K. Tsukagoshi, K. Nakazato, H. Ahmed, Hitachi Cambridge, UK 13:20 - 13:40 Programmable HBT-Quantum Dot Structures for Arithmetic MVL L. Micheel, Wright Lab., USA, A. Sigurdardottir, H. Hartnagel and K. Mutamba, Technical University of Darmstadt, Germany 13:40 - 14:00 GaAs- and InP-based Technologies of Resonant Tunneling Devices O. Dupuis, P. Mounaix, F. Mollot, O. Vanbesien, D. Lippens, IEMN, France 14:00 - 14:20 Nano-Fabrication Technology and Silicon Nano-Devices T. Baba, NEC Corporation, Japan 14:20 - 14:40 Refreshment break Session 3 : BDD/MDD Room 00-036 Chair: C. Scholl 14:40 - 15:00 Nonapproximability Results for OBDD- and FBDD-Minimization D. Sieling, University of Dortmund, Germany 15:00 - 15:20 Improving Reachability Analysis by means of Activity Profiles G. Cabodi, P. Camurati, S. Quer, Politecnico di Torino, Italy 15:20 - 15:40 A Word-Level Graph Representation Package S. Hoereth, Siemens, Germany 15:40 - 16:00 Interval Diagram Techniques and Their Applications K. Strehl, L. Thiele, ETH Zuerich, Switzerland 16:00 - 16:20 Refreshment break Session 4: Application of Information Theory to Logic Design Room 00-036 Chair: S. Yanushkevich 16:20 - 16:40 Information Theory Approach in Logic Design: Results, Trends and Non-Solved Problems S. Yanushkevich,Technical University of Szczecin, Poland, D. Simovici, University of Massachusetts at Boston, USA 16:40 - 17:00 Methods of Information Engine Theory in Simple Examples H. Watanabe, Soka University Tokyo, Japan, S. Yanushkevich, Technical University of Szczecin, Poland 17:00 - 17:20 Information Measure in Evolvable Algorithm for Synthesis of Combinational Circuits C. Moraga, University of Dortmund, Germany, J. Kolodziejczyk, M. Opoka, S. Yanushkevic, Technical University of Szczecin, Poland 17:20 - 17:40 Information Theoretical Approach in Reed- Muller Expansion Minimization D. Popel, Belarusian State University of Informatics and Radioelectronics, Belarus, V. Shmerko, S.Yanushkevich, Technical University of Szczecin, Poland 18:00 ISMVL99 welcome reception Conference Thursday, May 20 8:45 - 9:00 Opening remarks Room 00-036 R. Drechsler, Symposium Chair B. Becker, Director CS-Institute, University of Freiburg, Germany Session 1: Invited address Room 00-036 Chair: T. Hanyu 9:00 - 10:00 Development of Quantum Functional Devices for Multiple-Valued Logic Circuits T. Baba, NEC Corporation, Japan 10:00 - 10:30 Refreshment break Session 2a: Algebra I Room 00-036 Chair: I. Rosenberg 10:30 - 11:00 Multivalued Binary Relations and Post Algebras M. Serfati, University of Paris, France 11:00 - 11:30 On Axiomization of Conditional Entropy of Functions Between Finite Sets D. Simovici, S. Jaroszewicz, University of Massachusetts at Boston, USA 11:30 - 12:00 Quaternion Groups versus Dyadic Groups in Representations and Processing of Large Switching Functions R. Stankovic, D.Milenovic, D. Jankovic, University of Nis, Yugoslavia Session 2b: Circuits Room 00-010 Chair: Y. Hata 10:30 - 11:00 Multiple-Valued Content-Addressable Memory Using Metal-Ferroelectric- Semiconductor FETs T. Hanyu , H. Kimura, M. Kameyama, Tohoku University, Japan 11:00 - 11:30 New Lamps for Old! (Generalized Multiple- Valued Neurons) C. Moraga, R. Heider, University of Dortmund, Germany 11:30 - 12:00 Supplementary Symmetrical Logic Circuit Structure E. Olson, Moorpark, USA 12:00 - 13:30 Lunch (Executive Subcommittee Meeting) Session 3a: Decomposition Room 00-036 Chair: J. Muzio 13:30 - 14:00 Bi-Decomposition of Multi-Valued Functions for Circuit Design and Data Mining Applications B. Steinbach, University of Freiberg, Germany, M. Perkowski, Portland State University, USA, C. Lang, University of Freiberg, Germany 14:00 - 14:30 Totally Undecomposable Functions: Applications to Efficient Multiple-Valued Decompositions T. Sasao, Kyushu Institute of Technology, Japan 14:30 - 15:00 A Generalization of Shestakov's Function Decomposition Method J. Lou, ThoughtWorks Inc., USA, J. Brzozowski, University of Waterloo, Canada Session 3b: Clones Room 00-010 Chair: G. Pogosyan 13:30 - 14:00 Gigantic Pairs of Minimal Clones I. Rosenberg, University of Montreal, Canada, H. Machida, Hitotsubashi Unversity, Japan 14:00 - 14:30 Maximal Chains of Partial Clones Containing Idempotent Partial Functions L. Haddad, J. Fugere, Royal Military College of Canada 14:30 - 15:00 Partial Clones and their Generating Sets L. Haddad, Royal Military College of Canada, D. Lau, University of Rostock, Germany 15:00 - 15:30 Refreshment break Session 4a: Logic Design Room 00-036 Chair: C. Moraga 15:30 - 16:00 Evaluation of m-Valued Fixed Polarity Generalizations of Reed-Muller Canonical Forms E. Dubrova, Royal Institute of Technology, Sweden 16:00 - 16:30 Multiple-Valued Minimization to Optimize PLAs with Output EXOR Gates D. Debnath, T. Sasao, Kyushu Institute of Technology, Japan 16:30 - 17:00 The Output Permutation for the Multiple- Valued Logic Minimization with Universal Literals T. Hozumi, O. Kakusho Hyogo University, Y. Hata, Himeji Institute of Technology, Japan 17:00 - 17:30 Logic Model for Representing Uncertain Statuses of Multiple-Valued Logic Systems Realized by Min, Max and Literals N. Takagi, A. Hon-nami, K. Nakashima, Toyama Prefectural University, Japan Session 4b: Algebra Room 00-010 Chair: R. Haehnle 15:30 - 16:00 A Super Switch Algebra for Quantum Device based Systems G. Dueck, University of Antigonish, M. Hu, Aepos Technologies, B. Fraser, University of Antigonish, Canada 16:00 - 16:30 Clarifying the Axioms of Kleene Algebra based on the Method of Indeterminate Coefficients T. Ninomiya, M. Mukaidono, Meiji University, Japan 16:30 - 17:00 The Number of Cascade Functions G. Pogosyan, Christian University, Japan 17:00 - 17:30 Research on the Similarity among Precomplete Sets Preserving m-ary Relation in Partial K-Valued Logic L. Renren, Xiangtan University of Hunan, China 18:30 Welcome reception in Freiburg Friday, May 21 Session 5: Invited Address Room 00-036 Chair: E. Dubrova 9:00 - 10:00 Automata, Circuits and BDDs D. Basin, University of Freiburg, Germany 10:00 - 10:15 Refreshment break Session 6a: Decision Diagrams Room 00-036 Chair: R. Drechsler 10:15 - 10:45 Synthesis of Multiple-Valued Decision Diagrams using Current-Mode CMOS Circuits M. Abd-El-Barr, King Fahd University of Dhahran, Saudi Arabia, H. Fernandes, University of Saskatchewan, Canada 10:45 - 11:15 Shared Multiple-Valued Decision Diagrams for Multiple-Output Functions H. Md. H. Babu, T. Sasao, Kyushu Institute of Technology, Japan 11:15 - 11:45 Matrix-Valued EXOR-TDDs in Decompositon of Switching Functions R. Stankovic, University of Nis, Yugoslavia Session 6b: Circuits II Room 00-010 Chair: M. Kameyama 10:15 - 10:45 Ternary Multiplication Circuits Using 4-Input Adder Cells and Carry Look-Ahead A. Herrfeld, S. Hentschke, University of Kassel, Germany 10:45 - 11:15 Down Literal Circuit with Neuron-MOS Transistors and Its Applications J. Shen, K. Tanno, O. Ishizuka, Miyazaki University, Japan 11:15 - 11:45 Arithmetic Circuits for Analog Digits A.Saed, Nortel Networks, Canada, M. Ahmadi, G. Jullien, University of Windsor 11:45 - 13:00 Lunch (Symposium Subcommittee Meeting) Session 7a: Applications Room 00-036 Chair: R. Stankovic 13:00 - 13:30 Quaternary Coded Genetic Algorithms K. Freitag, SAG Systemhaus GmbH, L. Hildebrand, C. Moraga, University of Dortmund, Germany 13:30 - 14:00 Redundant Complex Arithmetic and Its Application to Complex Multiplier Design T. Aoki, K. Hoshi, T. Higuchi, Tohoku University, Japan 14:00 - 14:30 On the Number of Multilinear Partitions and the Computing Capacity of Multiple-Valued Multiple-Threshold Perceptrons A. Ngom, Lakehead University, Canada, I. Stojmenovi, University of Ottawa, Canada, J. Zunic, University of Novi Sad, Yugoslavia 14:30 - 14:45 Refreshment break 14:45 - 15:15 B-ternary Logic Based Asynchronous Micropipeline Y. Nagata, University of the Ryukyus, Japan, M. Miller, University of Victoria, Canada, M. Mukaidono, Meiji University, Japan 15:15 - 15:45 State Assignment Techniques in Multiple- Valued Logic K. Adams, J. Campbell, L. Maguire, J. Webb, University of Ulster, Northern Ireland, UK Session 7b: Logic Room 00-010 Chair: L. Haddad 13:00 - 13:30 Information Relationships and Measures in Application to Logic L. Jozwiak, Eindhoven University of Technology, The Netherlands 13:30 - 14:00 Probabilistic and Truth-Functional Many- Valued Logic Programming T. Lukasiewicz, University of Gießen, Germany 14:00 - 14:30 Representation Theorems and Theorem Proving in Non-Classical Logics V. Sofronie-Stokkermans, Max-Planck-Institut Saarbruecken, Germany 14:30 - 14:45 Refreshment break 14:45 - 15:15 Transformations between Signed and Classical Clause Logic B. Beckert, R. Haehnle, University of Karlsruhe, Germany, F. Manya, University of Lleida, Spain 15:15 - 15:45 Semirigidity Problems in k-Valued Logic M. Miyakawa, Tsukuba College of Technology, Japan 15:45 - 16:30 Plenary Session Room 00-036 G. Dueck, University of Antigonish, Canada 16:30 Social event Saturday, May 22 Session 8: Panel Discussion Room 00-036 Chair: J. Muzio 9:00 - 10:00 Multiple-Valued Logic in the Next Millenium: Challenges and Perspectives 10:00 - 10:30 Refreshment break Session 9a: Testing Room 00-036 Chair: T. Sasao 10:30 - 11:00 Fault Characterization and Testability Considerations in Multi-Valued Logic Circuits M. Abd-El-Barr, M. Al-Sharif, M. Osman, King Fahd University of Dhahran, Saudi Arabia 11:00 - 11:30 Highly Testable Group Based Logic Circuits U. Kalay , M. Perkowski, D. Hall, Portland State University, USA 11:30 - 12:00 Self-Checking Multiple-Valued Circuit Based on Dual-Rail Current-Mode Differential Logic T. Hanyu , T. Ike, M. Kameyama, Tohoku University, Japan Session 9b: Fuzzy Logic Room 00-010 Chair: O. Ishizuka 10:30 - 11:00 On the Concept of Qualitative Fuzzy Sets H. Thiele, University of Dortmund, Germany 11:00 - 11:30 On Some Classes of Fuzzy Information Granularity and Their Representations Y. Hata, Himeji Institute of Technology, M. Mukaidono, Meiji University, Japan 11:30 - 12:00 From a Fuzzy Flip-Flop to a MVL Flip-Flop L. Maguire, T. McGinnity, L. McDaid, University of Ulster, Northern Ireland, UK 12:00 - 12:15 Closing remarks Room 00-036 Notes Map

35. STUDIES IN LOGIC... - Editorial Board
Post algebras and Post logics. Volume 2(15), 1998. Arkadiusz Or owski Author Index. Mathematical methods on commodity exchanges Volume 5(18), 2002

Author index ...
Zbieæ Katarzyna

Wies³aw Banach Author Index
  • Hayek: an idea of self-organization and a critique of the constructivist utopia Volume 5(18), 2002
Boles³aw Borkowski Author Index
Edward Bryniarski Author Index
  • The notion of the truth in systems of knowledge. Volume 3(16), 1999
    (with Andrzej Krzysztof Rogalski, Urszula Wybraniec-Skardowska)
Katarzyna Doliwa Author Index
Wiktor Dañko, Jolanta Koszelew Author Index
  • The Post correspondence problem as a tool for proving undecidability in logics of Probabilistic programs. Volume 2(15), 1998
Adam Drozdek Author Index Anna Gomoliñska Author Index Renata Jermo³owicz Author Index
  • On the Project of a Universal Language in the Framework of the XVII Century Philosophy. Volume 6(19), 2003

36. Participants Agliano, Paolo Italy Idempotent Discriminators
On lattice meanders Berman, Joel USA Counting finite algebras in a variety. Michael France Post algebras and lattices of partitions Seselja,

37. PlanetMath: Logical Axiom
3 P. Halmos, S. Givant Logic as Algebra, The Mathematical Association of America, (1998). 4 H. Rasiowa Post algebras as a Semantic Foundation of $ m$
(more info) Math for the people, by the people. Encyclopedia Requests Forums Docs ... RSS Login create new user name: pass: forget your password? Main Menu sections Encyclop¦dia



meta Requests



talkback Polls
Feedback Bug Reports downloads Snapshots PM Book information News Docs Wiki ChangeLog ... About logical axiom (Definition) There are in general two ways of arriving at tautologies in any logical system. One is done semantically , via a truth function on the set of propositional variables , and extending the function to the larger set consisting of all (well-formed) formulas , and then declaring a tautology as any formula that is always mapped to The second way is done mechanically, or in logical jargon, syntactically , via a special set of well-formed formulas , called logical axioms , together witha ( finite ) set of rules of inference . Any formula axioms by applying the rules of inferences is called a tautology in question can be obtained by a finite sequence of formulas, such that is an axiom

38. Rasiowa Biography
Her thesis, presented in 1950, was on algebra and logic Algebraic treatment of especially on applications of various generalisations of Post algebras to
Helena Rasiowa
Born: 20 June 1917 in Vienna, Austria
Died: 9 Aug 1994 in Warsaw, Poland
Click the picture above
to see two larger pictures Show birthplace location Previous (Chronologically) Next Main Index Previous (Alphabetically) Next Biographies index
Version for printing
Although Helena Rasiowa was born in Vienna, her parents were Polish. In 1918 Poland regained its status as an independent nation and Rasiowa's parents moved to Warsaw. She was educated there, obtaining a good secondary school education with music lessons taken at a special music school. After completing her school studies she took a course in business management before entering university. Rasiowa entered the University of Warsaw in 1938 but, after the German invasion of Poland in 1939, the university closed. Rasiowa and her parents moved to Lvov but the Poles were trapped between the Soviets and the Germans and Lvov came under Soviet control. Life there seemed even more difficult than under German occupation, so after a year the family returned to Warsaw. There was an impressive collection of mathematicians at the University of Warsaw at this time including Borsuk Lukasiewicz Mazurkiewicz Sierpinski ... Mostowski and others. They had organised an underground version of the university which was strongly opposed by the Nazi authorities.

39. Directory Of Open Access Journals
In this paper we determine all the rings that are defined over a Post algebra and share the properties of the Serfati ring. In the case r = 3 one of them is

40. Representation Of Certain Classes Of Distributive Lattices By Sections Of Sheave
Epstein and Horn (6) proved that a Post algebra is always a P algebra and in a P -algebra, prime ideals lie in disjoint maximal chains.

Page 1     1-52 of 52    1