TYTUŁ

Bulletin of the Section of Logic Udostępnij

WYDAWCA Wydawnictwo Uniwersytetu Łódzkiego

ISSN 0138-0680 None

LICZBA WOLUMINÓW 51

2006 / Tom 35 / Numer 4 Wybierz inny

TYTUŁ ARTYKUŁU STRONY AUTORZY CZYNNOŚCI

iH-Propositional Calculus

s. 157 - 162

A.V. Figallo G. Ramon S. Saad

CZYSTY TEKST
A.V. Figallo, G. Ramon, S. Saad, iH-Propositional Calculus, Bulletin of the Section of Logic, 2006 / Tom 35 / Numer 4, s. 157 - 162

BIBTEX
@Article{ authors = " A.V. Figallo, G. Ramon, S. Saad", title = "iH-Propositional Calculus", journal = "Bulletin of the Section of Logic", issue = "2006 / Tom 35 / Numer 4", pages = "157 - 162" }
Neat Embeddings and Amalgamation

s. 163 - 171

Tarek Sayed Ahmed Basim Samir

CZYSTY TEKST
Tarek Sayed Ahmed, Basim Samir, Neat Embeddings and Amalgamation, Bulletin of the Section of Logic, 2006 / Tom 35 / Numer 4, s. 163 - 171

BIBTEX
@Article{ authors = " Tarek Sayed Ahmed, Basim Samir", title = "Neat Embeddings and Amalgamation", journal = "Bulletin of the Section of Logic", issue = "2006 / Tom 35 / Numer 4", pages = "163 - 171" }
An Example of a New Kind of Algebraizability

s. 173 - 185

David Gracia Garcia

CZYSTY TEKST
David Gracia Garcia, An Example of a New Kind of Algebraizability, Bulletin of the Section of Logic, 2006 / Tom 35 / Numer 4, s. 173 - 185

BIBTEX
@Article{ authors = " David Gracia Garcia", title = "An Example of a New Kind of Algebraizability", journal = "Bulletin of the Section of Logic", issue = "2006 / Tom 35 / Numer 4", pages = "173 - 185" }
An Equivalence Between Sequent Calculi for Linear-Time Temporal Logic

s. 187 - 193

Norihiro Kamide

CZYSTY TEKST
Norihiro Kamide, An Equivalence Between Sequent Calculi for Linear-Time Temporal Logic, Bulletin of the Section of Logic, 2006 / Tom 35 / Numer 4, s. 187 - 193

BIBTEX
@Article{ authors = " Norihiro Kamide", title = "An Equivalence Between Sequent Calculi for Linear-Time Temporal Logic", journal = "Bulletin of the Section of Logic", issue = "2006 / Tom 35 / Numer 4", pages = "187 - 193" }
On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs

s. 195 - 214

Haroldo G. Benatti Ruy J.G.B. de Queiroz

CZYSTY TEKST
Haroldo G. Benatti, Ruy J.G.B. de Queiroz, On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs, Bulletin of the Section of Logic, 2006 / Tom 35 / Numer 4, s. 195 - 214

BIBTEX
@Article{ authors = " Haroldo G. Benatti, Ruy J.G.B. de Queiroz", title = "On the Descriptive Complexity of the Two Disjoint Paths Problem Over Undirected Graphs", journal = "Bulletin of the Section of Logic", issue = "2006 / Tom 35 / Numer 4", pages = "195 - 214" }