default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIldikó Sain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j18]Szabolcs Mikulás, Ildikó Sain, András Simon:
Complexity of equational theory of relational algebras with standard projection elements. Synth. 192(7): 2159-2182 (2015)
2000 – 2009
- 2000
- [j17]Ildikó Sain:
On the Search for a Finitizable Algebraization of First Order Logic. Log. J. IGPL 8(4): 497-591 (2000)
1990 – 1999
- 1997
- [j16]Ildikó Sain, Viktor Gyuris:
Finite Schematizable Algebraic Logic. Log. J. IGPL 5(5): 699-751 (1997) - 1995
- [j15]István Németi, Ildikó Sain, András Simon:
Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators. Log. J. IGPL 3(1): 93-105 (1995) - [j14]Ágnes Kurucz, István Németi, Ildikó Sain, András Simon:
Decidable and Undecidable Logics with a Binary Modality. J. Log. Lang. Inf. 4(3): 191-206 (1995) - 1993
- [j13]Balázs Biró, Ildikó Sain:
Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic Logics. Ann. Pure Appl. Log. 63(3): 201-225 (1993) - [j12]Ágnes Kurucz, István Németi, Ildikó Sain, András Simon:
Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus. Log. J. IGPL 1(1): 91-98 (1993) - [c12]Hajnal Andréka, István Németi, Ildikó Sain:
Applying Algebraic Logic to Logic. AMAST 1993: 5-26 - 1992
- [j11]Ildikó Sain:
Temporal Logics Need Their Clocks. Theor. Comput. Sci. 95(1): 75-95 (1992) - 1991
- [j10]Hajnal Andréka, István Németi, Ildikó Sain:
On the Strength of Temporal Proofs. Theor. Comput. Sci. 80(2): 125-151 (1991) - 1990
- [c11]Ildikó Sain:
Past Proves More Invariance Properties but not PCA's. IMYCS 1990: 80-92 - [c10]Ildikó Sain:
Results on the Glory of the Past. MFCS 1990: 478-484
1980 – 1989
- 1989
- [j9]Ildikó Sain:
An Elementary Proof for Some Semantic Characterizations of Nondeterministic Floyd-Hoare Logic. Notre Dame J. Formal Log. 30(4): 563-573 (1989) - [j8]Johann A. Makowsky, Ildikó Sain:
Weak Second Order Characterizations of Various Program Verification Systems. Theor. Comput. Sci. 66(3): 299-321 (1989) - [c9]Ana Pasztor, Ildikó Sain:
A Streamlined Temporal Completeness Theorem. CSL 1989: 322-336 - [c8]Hajnal Andréka, István Németi, Ildikó Sain:
On the Strength of Temporal Proofs. MFCS 1989: 135-144 - 1988
- [j7]Ildikó Sain:
Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theorem. Notre Dame J. Formal Log. 29(3): 332-344 (1988) - [j6]Ildikó Sain:
Is "some-other-time" sometimes better than "sometime" for proving partial correctness of programs? Stud Logica 47(3): 279-301 (1988) - [c7]Ildikó Sain:
Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic. Algebraic Logic and Universal Algebra in Computer Science 1988: 209-225 - 1987
- [j5]Ildikó Sain:
Total Correctness in Nonstandard Logics of Programs. Theor. Comput. Sci. 50: 285-321 (1987) - 1986
- [c6]Johann A. Makowsky, Ildikó Sain:
On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems. LICS 1986: 293-300 - 1985
- [j4]Ildikó Sain:
A Simple Proof for the Completeness of Floyd's Method. Theor. Comput. Sci. 35: 345-348 (1985) - [c5]Ildikó Sain:
The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods. Logic of Programs 1985: 302-342 - 1984
- [j3]Ildikó Sain:
Structured Nonstandard Dynamic Logic. Math. Log. Q. 30(31): 481-497 (1984) - 1982
- [j2]Hajnal Andréka, István Németi, Ildikó Sain:
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I. Theor. Comput. Sci. 17: 193-212 (1982) - [j1]Hajnal Andréka, István Németi, Ildikó Sain:
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II. Theor. Comput. Sci. 17: 259-278 (1982) - 1981
- [c4]Ildikó Sain:
First Order Dynamic Logic with Decidable Proofs and Workable Model Theory. FCT 1981: 334-340 - [c3]Hajnal Andréka, István Németi, Ildikó Sain:
A Characterization of Floyd-Provable Programs. MFCS 1981: 162-171
1970 – 1979
- 1979
- [c2]Hajnal Andréka, István Németi, Ildikó Sain:
Henkin-type semantics for program-schemes to turn negative results to positive. FCT 1979: 18-24 - [c1]Hajnal Andréka, István Németi, Ildikó Sain:
Completeness Problems in Verification of Programs and Program Schemes. MFCS 1979: 208-218
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-04-25 05:43 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:
