default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDietlinde Lau
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[c6]Dietlinde Lau, Karsten Schölzel
:
A Classification of Partial Boolean Clones. ISMVL 2010: 189-194
2000 – 2009
- 2007
- [j13]Lucien Haddad, Dietlinde Lau:
Some Criteria for Partial Sheffer Functions in k-valued Logic. J. Multiple Valued Log. Soft Comput. 13(4-6): 415-446 (2007) - [c5]Lucien Haddad, Dietlinde Lau:
Characterization of Partial Sheffer Functions in 3-Valued Logic. ISMVL 2007: 34 - [c4]Dietlinde Lau, Masahiro Miyakawa:
Classifications and Enumeration of Bases in P_{3}(2). ISMVL 2007: 45 - 2006
- [j12]Lucien Haddad, Dietlinde Lau, Ivo G. Rosenberg:
Intervals of Partial Clones Containing Maximal Clones. J. Autom. Lang. Comb. 11(4): 399-421 (2006) - 2004
- [c3]Lucien Haddad, Dietlinde Lau:
On Partial Clones containing Maximal Clones. ISMVL 2004: 96-101
1990 – 1999
- 1999
- [c2]Lucien Haddad, Dietlinde Lau:
Partial Clones and their Generating Sets. ISMVL 1999: 85-90 - 1992
- [j11]Dietlinde Lau:
A Completeness Criterion for Pk(l). J. Inf. Process. Cybern. 28(3): 87-112 (1992) - [j10]Dietlinde Lau:
Ein neuer Beweis für Rosenberg's Vollständigkeitskriterium. J. Inf. Process. Cybern. 28(4): 149-195 (1992) - 1991
- [j9]Dietlinde Lau:
On Closed Subsets of Boolean Functions (A New Proof for Post's Theorem). J. Inf. Process. Cybern. 27(3): 167-178 (1991) - 1990
- [c1]Masahiro Miyakawa, Ivan Stojmenovic, Dietlinde Lau, Taketoshi Mishima:
On the Structure of Maximal Closed Sets of PK2. ISMVL 1990: 254-261
1980 – 1989
- 1988
- [j8]Dietlinde Lau:
Über abgeschlossene Mengen linearer Funktionen in mehrwertigen Logiken. J. Inf. Process. Cybern. 24(7/8): 367-381 (1988) - [j7]Dietlinde Lau:
Über abgeschlossene Teilmengen von Pk, 2. J. Inf. Process. Cybern. 24(10): 495-513 (1988) - [j6]Dietlinde Lau:
Über abgeschlossene Teilmengen von P3, 2. J. Inf. Process. Cybern. 24(11/12): 561-572 (1988) - 1985
- [j5]Dietlinde Lau:
On Subalgebras of an Algebra of Predicates. J. Inf. Process. Cybern. 21(1/2): 9-22 (1985) - 1982
- [j4]Dietlinde Lau:
Submaximale Klassen von P3. J. Inf. Process. Cybern. 18(4/5): 227-243 (1982)
1970 – 1979
- 1978
- [j3]Dietlinde Lau:
Über die Anzahl von abgeschlossenen Mengen linearer Funktionen der n-wertigen Logik. J. Inf. Process. Cybern. 14(11): 561-563 (1978) - [j2]Dietlinde Lau:
Bestimmung der Ordnung Maximaler Klassen von Funktionen der k-Wertigen Logik. Math. Log. Q. 24(1-6): 79-96 (1978) - 1975
- [j1]Dietlinde Lau:
Prävollständige Klassen von P(k, l). J. Inf. Process. Cybern. 11(10-12): 624-626 (1975)
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:
