4 papers
SAT Solving by Multiplication in and Addition out of Clauses
Pelle Brooke Borgeke
In this article, we use the PBNF-transform, or Polynomial Boolean Normal Form, described in the two earlier articles and now extended to higher arity, to solve Boolean satisfiabili…
PBNF-transform as a formulation of Propositional Calculus, II
Pelle Brooke Borgeke
Here we show, in the second paper in a series of articles, methods to calculate propositional statements with algebraic polyno mials as symbols for the connectives, which here are…
PBNF-transform as a formulation of Propositional Calculus, I
Pelle Brooke Borgeke
Here, in a series of articles, we show methods for calculating propositional statements using algebraic polynomials as symbols for the connectives, which are named operators. These…
Subprincipal Controlled Quasimodes and Spectral Instability
Pelle Brooke Borgeke
Here we explore, in a series of articles, semiclassical quasimodes u(h,b), approximative solutions P(h)u(h,b)\sim 0, depending on , and on b, the subprincipal symbol. We stu…