![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Gustavo Pelaitay
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Carlos Gallardo, Gustavo Pelaitay
, Cecilia Segura Gallardo:
T-rough symmetric Heyting algebras with tense operators. Fuzzy Sets Syst. 466: 108455 (2023) - [j16]Aldo V. Figallo, Gustavo Pelaitay, Jonathan Sarmiento
:
Discrete Duality for Nelson Algebras with Tense Operators. Stud Logica 111(1): 1-19 (2023) - [j15]Gustavo Pelaitay
, William Zuluaga
:
Tense Operators on Distributive Lattices with Implication. Stud Logica 111(4): 687-708 (2023) - [j14]Federico G. Almiñana, Gustavo Pelaitay, William Zuluaga
:
On Heyting Algebras with Negative Tense Operators. Stud Logica 111(6): 1015-1036 (2023) - 2022
- [j13]Federico Almiñana, Gustavo Pelaitay
:
Monadic k˟ j-rough Heyting algebras. Arch. Math. Log. 61(5-6): 611-625 (2022) - [j12]Federico Almiñana, Gustavo Pelaitay:
A Representation Theorem for k × j -rough Heyting Algebras. J. Multiple Valued Log. Soft Comput. 38(5-6): 603-614 (2022) - [j11]Aldo V. Figallo, Jonathan Sermento, Gustavo Pelaitay
:
A Categorical Equivalence for Tense Nelson Algebras. Stud Logica 110(1): 241-263 (2022) - 2021
- [j10]Aldo V. Figallo, Gustavo Pelaitay
, Jonathan Sarmiento
:
An Algebraic Study of Tense Operators on Nelson Algebras. Stud Logica 109(2): 285-312 (2021) - 2020
- [j9]Aldo V. Figallo, Gustavo Pelaitay, Jonathan Sarmiento
:
Cn algebras with Moisil possibility operators. Log. J. IGPL 28(6): 1141-1154 (2020) - [j8]Federico Almiñana, Gustavo Pelaitay:
A Topological Duality for k × j-rough Heyting Algebras. J. Multiple Valued Log. Soft Comput. 35(3-4): 307-323 (2020)
2010 – 2019
- 2019
- [j7]Aldo V. Figallo, Inés Pascual, Gustavo Pelaitay
:
A topological duality for tense $$\theta $$ θ -valued Łukasiewicz-Moisil algebras. Soft Comput. 23(12): 3979-3997 (2019) - 2018
- [j6]Aldo V. Figallo, Inés Pascual, Gustavo Pelaitay
:
A topological duality for tense $$\boldsymbol{LM_n}$$-algebras and applications1. Log. J. IGPL 26(4): 339-380 (2018) - [j5]Aldo V. Figallo, Inés Pascual, Gustavo Pelaitay
:
Principal and Boolean Congruences on $$\varvec{IKt}$$ IKt -Algebras. Stud Logica 106(4): 857-882 (2018) - 2017
- [j4]Aldo V. Figallo, Inés Pascual, Gustavo Pelaitay
:
Subdirectly Irreducible IKt-Algebras. Stud Logica 105(4): 673-701 (2017) - 2015
- [j3]Aldo V. Figallo, Gustavo Pelaitay
:
Discrete Duality for Tense Łukasiewicz-Moisil Algebras. Fundam. Informaticae 136(4): 317-329 (2015) - 2014
- [j2]Aldo V. Figallo, Gustavo Pelaitay
:
Tense operators on De Morgan algebras. Log. J. IGPL 22(2): 255-267 (2014) - [j1]Aldo V. Figallo, Gustavo Pelaitay
:
An algebraic axiomatization of the Ewald's intuitionistic tense logic. Soft Comput. 18(10): 1873-1883 (2014)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-05-08 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint