default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomasz Kowalski
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Guillermo Badia, Daniel Gaina, Alexander Knapp, Tomasz Kowalski
, Martin Wirsing:
Hybrid-Dynamic Ehrenfeucht-Fraïssé Games. CoRR abs/2406.02094 (2024)- 2023
- [j36]Daniel Gaina, Guillermo Badia, Tomasz Kowalski:
Omitting types theorem in hybrid dynamic first-order logic with rigid symbols. Ann. Pure Appl. Log. 174(3): 103212 (2023) - [j35]Michal Botur, Tomasz Kowalski:
Kites and representations of pseudo MV-algebras. Fuzzy Sets Syst. 455: 158-182 (2023) - 2022
- [j34]Daniel Gaina, Tomasz Kowalski:
Lindström's theorem, both syntax and semantics free. J. Log. Comput. 32(5): 942-975 (2022) - [j33]Tomasz Kowalski, Gian Piero Gibiino, Jaroslaw Szewinski, Krzysztof Czuba, Dominik Rybka, Konrad Chmielewski, Zbigniew Wojciechowski, Maciej Sitek:
Experimental Evaluation of Sub-Sampling IQ Detection for Low-Level RF Control in Particle Accelerator Systems. Sensors 22(1): 38 (2022) - [c9]Guillermo Badia, Tomasz Kowalski, Daniel Gaina:
Robinson consistency in many-sorted hybrid first-order logics. AiML 2022: 407-428 - [i3]Badriah Al Juaid, Marcel Jackson, James Koussas, Tomasz Kowalski:
Qualitative representations of chromatic algebras. CoRR abs/2201.03098 (2022) - 2021
- [j32]Brian A. Davey, Tomasz Kowalski, Christopher J. Taylor:
Splittings in varieties of logic. Int. J. Algebra Comput. 31(4): 727-774 (2021) - 2020
- [j31]Daniel Gaina, Tomasz Kowalski:
Fraïssé-Hintikka theorem in institutions. J. Log. Comput. 30(7): 1377-1399 (2020)
2010 – 2019
- 2019
- [j30]Tomasz Kowalski, George Metcalfe:
Uniform interpolation and coherence. Ann. Pure Appl. Log. 170(7): 825-841 (2019) - [j29]Robin Hirsch, Marcel Jackson, Tomasz Kowalski:
Algebraic foundations for qualitative calculi and networks. Theor. Comput. Sci. 768: 99-116 (2019) - 2018
- [c8]James Koussas, Tomasz Kowalski, Yutaka Miyazaki, Michael Stevens:
Normal Extensions of KTB of Codimension 3. Advances in Modal Logic 2018: 447-458 - [c7]Tomasz Kowalski, George Metcalfe:
Coherence in Modal Logic. Advances in Modal Logic 2018: 459-472 - 2017
- [j28]Tomasz Kowalski, Hiroakira Ono:
Analytic Cut and interpolation for bi-intuitionistic Logic. Rev. Symb. Log. 10(2): 259-283 (2017) - [c6]Karol Seweryn, Jedrzej Baran, Tomasz Barcinski, Pablo Colmenarejo, Aleksander Los, Tomasz Kowalski, Luis Mollinedo, Dario Mora, Jacek Musial, Gabriele Novelli, Jakub Oles, Katarzyna Ososinska, Pawel Pasko, Gaetano Prisco, Tomasz Rybus, Pedro Serra, Roman Wawrzaszek, Jesus Gil Fernandez:
The prototype of space manipulator WMS LEMUR dedicated to capture tumbling satellites in on-orbit environment. RoMoCo 2017: 15-22 - 2016
- [j27]Marcel Jackson, Tomasz Kowalski, Todd Niven:
Complexity and polymorphisms for digraph constraint problems under some basic constructions. Int. J. Algebra Comput. 26(7): 1395-1433 (2016) - [j26]Tomasz Kowalski, Lloyd Humberstone:
An Abelian Rule for BCI - and Variations. Notre Dame J. Formal Log. 57(4): 551-568 (2016) - [i2]Robin Hirsch, Marcel Jackson, Tomasz Kowalski, Todd Niven:
Algebraic foundations for qualitative calculi and networks. CoRR abs/1606.09140 (2016) - 2014
- [j25]Tomasz Kowalski, Antonio Ledda, Francesco Paoli:
Quasi-subtractive varieties: Open filters, congruences and the commutator. Log. J. IGPL 22(6): 844-871 (2014) - [j24]Francesco Paoli, Antonio Ledda, Tomasz Kowalski, Matthew Spinks:
Quasi-discriminator varieties. Int. J. Algebra Comput. 24(3): 375- (2014) - [j23]Robert Goldblatt, Tomasz Kowalski:
The Power of a Propositional Constant. J. Philos. Log. 43(1): 133-152 (2014) - [j22]Tomasz Kowalski:
BCK is not Structurally Complete. Notre Dame J. Formal Log. 55(2): 197-204 (2014) - 2013
- [c5]Tomasz Kowalski:
Relevant logic and relation algebras. TACL 2013: 125-128 - [c4]Antonio Ledda, Tomasz Kowalski, Francesco Paoli, Antonino Salibra:
Boolean like algebras. TACL 2013: 141-144 - [i1]Marcel Jackson, Tomasz Kowalski, Todd Niven:
Digraph related constructions and the complexity of digraph homomorphism problems. CoRR abs/1304.4986 (2013) - 2012
- [j21]Bakhadyr Khoussainov, Tomasz Kowalski:
Computable Isomorphisms of Boolean Algebras with Operators. Stud Logica 100(3): 481-496 (2012) - [j20]Michal Botur, Anatolij Dvurecenskij, Tomasz Kowalski:
On normal-valued basic pseudo-hoops. Soft Comput. 16(4): 635-644 (2012) - 2011
- [j19]Anatolij Dvurecenskij, Tomasz Kowalski, Franco Montagna:
State morphism MV-algebras. Int. J. Approx. Reason. 52(8): 1215-1228 (2011) - [j18]Tomasz Kowalski, Francesco Paoli, Matthew Spinks:
Quasi-subtractive varieties. J. Symb. Log. 76(4): 1261-1286 (2011) - [j17]Antonio Ledda, Tomasz Kowalski, Francesco Paoli:
On Certain Quasivarieties of Quasi-MV Algebras. Stud Logica 98(1-2): 149-174 (2011) - 2010
- [j16]Tomasz Kowalski, Hiroakira Ono:
Fuzzy logics from substructural perspective. Fuzzy Sets Syst. 161(3): 301-310 (2010) - [j15]Francesco Paoli, Tomasz Kowalski:
On some properties of quasi MV algebras and square root quasi MV algebras. Part III. Reports Math. Log. 45: 161-199 (2010) - [j14]Tomasz Kowalski, Francesco Paoli, Roberto Giuntini, Antonio Ledda:
The Lattice of Subvarieties of $${\sqrt{\prime}}$$ quasi-MV Algebras. Stud Logica 95(1-2): 37-61 (2010)
2000 – 2009
- 2009
- [j13]Giuseppe Sergioli, Antonio Ledda, Francesco Paoli, Roberto Giuntini, Tomasz Kowalski, Franco Montagna, Hector Freytes, Claudio Marini:
Two cooperative versions of the Guessing Secrets problem. Inf. Sci. 179(20): 3645-3658 (2009) - [p1]Tomasz Kowalski, Yutaka Miyazaki:
All Splitting Logics in the Lattice NExt(KTB). Towards Mathematical Philosophy 2009: 53-67 - 2008
- [j12]Tomasz Kowalski:
Self-implications in BCI. Notre Dame J. Formal Log. 49(3): 295-305 (2008) - [j11]Tomasz Kowalski, John K. Slaney:
A finite fragment of S3. Reports Math. Log. 43: 65-72 (2008) - [c3]Jason Jingshi Li, Tomasz Kowalski, Jochen Renz, Sanjiang Li:
Combining binary constraint networks in qualitative reasoning. ECAI 2008: 515-519 - 2006
- [j10]Sam Butchart, Tomasz Kowalski:
A Note on Monothetic BCI. Notre Dame J. Formal Log. 47(4): 541-544 (2006) - [j9]Yosuke Katoh, Tomasz Kowalski, Masaki Ueda:
Almost minimal varieties related to fuzzy logic. Reports Math. Log. 41: 173-194 (2006) - [j8]Tomasz Kowalski, Marcus Kracht:
Semisimple Varieties of Modal Algebras. Stud Logica 83(1-3): 351-363 (2006) - [c2]Tomasz Kowalski:
Net Verifier of Discrete Event System models expressed by UML Activity Diagrams. SMC 2006: 3405-3410 - 2004
- [j7]Tomasz Kowalski:
Semisimplicity, EDPC and Discriminator Varieties of Residuated Lattices. Stud Logica 77(2): 255-265 (2004) - 2003
- [c1]Krzysztof Jassem, Filip Gralinski, Tomasz Kowalski:
Applying Transition Networks in Translating Polish E-Mails. IIS 2003: 521-527 - 2000
- [j6]Tomasz Kowalski, Hiroakira Ono:
The Variety of Residuated Lattices is Generated by its Finite Simple Members. Reports Math. Log. 34: 59-77 (2000) - [j5]Tomasz Kowalski, Hiroakira Ono:
Remarks on Splittings in the Variety of Residuated Lattices. Reports Math. Log. 34: 133-140 (2000)
1990 – 1999
- 1999
- [j4]Tomasz Kowalski:
Pretabular Varieties of Equivalential Algebras. Reports Math. Log. 33: 3-10 (1999) - 1998
- [j3]Tomasz Kowalski:
Varieties of Tense Algebras. Reports Math. Log. 32: 53-95 (1998) - 1995
- [j2]Tomasz Kowalski:
The Bottom of the Lattice of BCK-varieties. Reports Math. Log. 29: 87-93 (1995) - 1994
- [j1]Tomasz Kowalski:
A Syntactic Proof of a Conjecture of Andrzej Wronski. Reports Math. Log. 28: 81-86 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
