-
Some Algebraic and Algorithmic Problems in Acoustocerebrography Opublikowano w: Bulletin of the Section of Logic 2016 / Tom 45 / Numer 3-4 / s. 241 - 2582016CZYSTY TEKST
Adam Kolany, Mirosław Wróbel, Some Algebraic and Algorithmic Problems in Acoustocerebrography, Bulletin of the Section of Logic, 2016 / Tom 45 / Numer 3-4, s. 241 - 258
BIBTEX@Article{ authors = " Adam Kolany, Mirosław Wróbel", title = "Some Algebraic and Algorithmic Problems in Acoustocerebrography", journal = "Bulletin of the Section of Logic", issue = "2016 / Tom 45 / Numer 3-4", pages = "241 - 258" }
-
Lattices of non-Locally Finite Hypergraphs are not Heyting Opublikowano w: Bulletin of the Section of Logic 2006 / Tom 35 / Numer 2-3 / s. 105 - 1092006CZYSTY TEKST
Adam Kolany, Lattices of non-Locally Finite Hypergraphs are not Heyting, Bulletin of the Section of Logic, 2006 / Tom 35 / Numer 2-3, s. 105 - 109
BIBTEX@Article{ authors = " Adam Kolany", title = "Lattices of non-Locally Finite Hypergraphs are not Heyting", journal = "Bulletin of the Section of Logic", issue = "2006 / Tom 35 / Numer 2-3", pages = "105 - 109" }
-
Logical aspects of hypergraphs Opublikowano w: Bulletin of the Section of Logic 1993 / Tom 22 / Numer 1 / s. 18 - 231993CZYSTY TEKST
Adam Kolany, Logical aspects of hypergraphs, Bulletin of the Section of Logic, 1993 / Tom 22 / Numer 1, s. 18 - 23
BIBTEX@Article{ authors = " Adam Kolany", title = "Logical aspects of hypergraphs", journal = "Bulletin of the Section of Logic", issue = "1993 / Tom 22 / Numer 1", pages = "18 - 23" }
-
Equivalents of the compactness theorem for locally finite sets of sentences Opublikowano w: Bulletin of the Section of Logic 1992 / Tom 21 / Numer 1 / s. 12 - 181992CZYSTY TEKST
Adam Kolany, Equivalents of the compactness theorem for locally finite sets of sentences, Bulletin of the Section of Logic, 1992 / Tom 21 / Numer 1, s. 12 - 18
BIBTEX@Article{ authors = " Adam Kolany", title = "Equivalents of the compactness theorem for locally finite sets of sentences", journal = "Bulletin of the Section of Logic", issue = "1992 / Tom 21 / Numer 1", pages = "12 - 18" }
-
Rado Selection Lemma and Other Combinatorial Statements Uniformly Proved Opublikowano w: Bulletin of the Section of Logic 2005 / Tom 34 / Numer 3 / s. 143 - 1492005CZYSTY TEKST
Adam Kolany, Rado Selection Lemma and Other Combinatorial Statements Uniformly Proved, Bulletin of the Section of Logic, 2005 / Tom 34 / Numer 3, s. 143 - 149
BIBTEX@Article{ authors = " Adam Kolany", title = "Rado Selection Lemma and Other Combinatorial Statements Uniformly Proved", journal = "Bulletin of the Section of Logic", issue = "2005 / Tom 34 / Numer 3", pages = "143 - 149" }
-
Representation theorems for hypergraph satisfiability Opublikowano w: Bulletin of the Section of Logic 1997 / Tom 26 / Numer 1 / s. 12 - 191997CZYSTY TEKST
Adam Kolany, Representation theorems for hypergraph satisfiability, Bulletin of the Section of Logic, 1997 / Tom 26 / Numer 1, s. 12 - 19
BIBTEX@Article{ authors = " Adam Kolany", title = "Representation theorems for hypergraph satisfiability", journal = "Bulletin of the Section of Logic", issue = "1997 / Tom 26 / Numer 1", pages = "12 - 19" }
-
On the logic of lie Opublikowano w: Bulletin of the Section of Logic 1993 / Tom 22 / Numer 2 / s. 72 - 791993CZYSTY TEKST
Adam Kolany, On the logic of lie, Bulletin of the Section of Logic, 1993 / Tom 22 / Numer 2, s. 72 - 79
BIBTEX@Article{ authors = " Adam Kolany", title = "On the logic of lie", journal = "Bulletin of the Section of Logic", issue = "1993 / Tom 22 / Numer 2", pages = "72 - 79" }
-
Changing a Numbering System is Usually Uncomputable Opublikowano w: Bulletin of the Section of Logic 2011 / Tom 40 / Numer 1-2 / s. 63 - 672011CZYSTY TEKST
Adam Kolany, Changing a Numbering System is Usually Uncomputable, Bulletin of the Section of Logic, 2011 / Tom 40 / Numer 1-2, s. 63 - 67
BIBTEX@Article{ authors = " Adam Kolany", title = "Changing a Numbering System is Usually Uncomputable", journal = "Bulletin of the Section of Logic", issue = "2011 / Tom 40 / Numer 1-2", pages = "63 - 67" }
