default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWieslaw Szwast
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j9]Ian Pratt-Hartmann
, Wieslaw Szwast, Lidia Tendera:
The Fluted Fragment Revisited. J. Symb. Log. 84(3): 1020-1048 (2019)- [j8]Wieslaw Szwast, Lidia Tendera:
On the satisfiability problem for fragments of two-variable logic with one transitive relation. J. Log. Comput. 29(6): 881-911 (2019) - 2018
- [i2]Wieslaw Szwast, Lidia Tendera:
On the satisfiability problem for fragments of the two-variable logic with one transitive relation. CoRR abs/1804.09447 (2018) - [i1]Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
Quine's Fluted Fragment Revisited. CoRR abs/1812.06440 (2018) - 2016
- [c7]Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
Quine's Fluted Fragment is Non-Elementary. CSL 2016: 39:1-39:21 - 2013
- [c6]Wieslaw Szwast, Lidia Tendera:
FO^2 with one transitive relation is decidable. STACS 2013: 317-328
2000 – 2009
- 2005
- [c5]Wieslaw Szwast, Lidia Tendera:
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity. LPAR 2005: 307-321 - 2004
- [j7]Wieslaw Szwast, Lidia Tendera:
The guarded fragment with transitive guards. Ann. Pure Appl. Log. 128(1-3): 227-276 (2004) - 2001
- [c4]Wieslaw Szwast, Lidia Tendera:
On the Decision Problem for the Guarded Fragment with Transitivity. LICS 2001: 147-156 - 2000
- [j6]Leszek Pacholski, Wieslaw Szwast, Lidia Tendera:
Complexity Results for First-Order Two-Variable Logic with Counting. SIAM J. Comput. 29(4): 1083-1117 (2000)
1990 – 1999
- 1997
- [c3]Leszek Pacholski, Wieslaw Szwast, Lidia Tendera:
Complexity of Two-Variable Logic with Counting. LICS 1997: 318-327 - 1995
- [j5]Wieslaw Szwast:
A Note on the Asymptotic Probabilities of Existential Second-Order Minimal Gödel Sentences with Equality. Int. J. Found. Comput. Sci. 6(4): 339-351 (1995) - 1993
- [j4]Leszek Pacholski, Wieslaw Szwast:
A Counterexample to the 0-1 Law for the Class of Existential Second-Order Minimal Gödel Sentences with Equality. Inf. Comput. 107(1): 91-103 (1993) - 1991
- [j3]Leszek Pacholski, Wieslaw Szwast:
Asymptotic Probabilities of Existential Second-Order Gödel Structures. J. Symb. Log. 56(2): 427-438 (1991) - [j2]Wieslaw Szwast:
On Horn Spectra. Theor. Comput. Sci. 82(2): 329-339 (1991) - [c2]Leszek Pacholski, Wieslaw Szwast:
On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality. LICS 1991: 280-285 - 1990
- [j1]Wieslaw Szwast:
On the generator problem. Math. Log. Q. 36(1): 23-27 (1990)
1980 – 1989
- 1989
- [c1]Leszek Pacholski, Wieslaw Szwast:
The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with Equality. FOCS 1989: 160-163
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 2025-01-21 00:18 CET 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:
