Order:
  1.  26
    Satisfiability on hypergraphs.Adam Kolany - 1993 - Studia Logica 52 (3):393-404.
    In [4] R.Cowen considers a generalization of the resolution rule for hypergraphs and introduces a notion of satisfiability of families of sets of vertices via 2-colorings piercing elements of such families. He shows, for finite hypergraphs with no one-element edges that if the empty set is a consequence ofA by the resolution rule, thenA is not satisfiable. Alas the converse is true for a restricted class of hypergraphs only, and need not to be true in the general case. In this (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  2.  44
    A general method of solving Smullyan's puzzles.Adam Kolany - 1996 - Logic and Logical Philosophy 4:97-103.
    In this paper we present a general method of solving Smullyan’s puzzles. We do this by showing how a puzzle is translated into Classical Propositional Calculus.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Lattices of non-Locally Finite Hypergraphs are not Heyting.Adam Kolany - 2006 - Bulletin of the Section of Logic 35 (2/3):105-109.
     
    Export citation  
     
    Bookmark  
  4.  66
    Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.
    In the following we show that general property S considered by Cowen [1], Cowen and Kolany in [3] and earlier by Cowen in [2] and Kolany in [4] as hypergraph satisfiability, can be constructively reduced to (3, 2) · SAT , that is to satisfiability of (at most) triples with two-element forbidden sets. This is an analogue of the“classical” result on the reduction of SAT to 3 · SAT.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  22
    Rado selection lemma and other combinatorial statements uniformly proved.Adam Kolany - 2005 - Bulletin of the Section of Logic 34 (3):143-149.
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  11
    Some Algebraic and Algorithmic Problems in Acoustocerebrography.Adam Kolany & Miroslaw Wrobel - 2016 - Bulletin of the Section of Logic 45 (3/4).
    Progress in the medical diagnostic is relentlessly pushing the measurement technology as well with its intertwined mathematical models and solutions. Mathematics has applications to many problems that are vital to human health but not for all. In this article we describe how the mathematics of acoustocerebrography has become one of the most important applications of mathematics to the problems of brain monitoring as well we will show some algebraic problems which still have to be solved. Acoustocerebrography is a set of (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark