First Page | Document Content | |
---|---|---|
![]() Date: 2016-07-15 23:00:36Boolean algebra Forcing Theoretical computer science Mathematics Complete Boolean algebra Order theory Assertion Mathematical logic | Add to Reading List |
![]() | On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID LisbonDocID: 1rsZm - View Document |
![]() | Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:DocID: 1roWY - View Document |
![]() | No complete linear term rewriting system for propositional logic Anupam Das and Lutz Straßburger Abstract Recently it has been observed that the set of all sound linear inference rules in propositionalDocID: 1qNTb - View Document |
![]() | Microsoft Word - IBSdocDocID: 1qERD - View Document |
![]() | Introduction & Motivation Relations and Operations Boolean and 3-element casesDocID: 1qCnb - View Document |