default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiorgi Japaridze
Person information
- affiliation: Villanova University, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i33]Giorgi Japaridze:
A propositional cirquent calculus for computability logic. CoRR abs/2406.05879 (2024)- [i32]Giorgi Japaridze:
Thoughts on sub-Turing interactive computability. CoRR abs/2411.01393 (2024) - 2021
- [j38]Giorgi Japaridze:
Elementary-base cirquent calculus II: Choice quantifiers. Log. J. IGPL 29(5): 769-782 (2021) - [i31]Giorgi Japaridze, Bikal Lamichhane:
Cirquent calculus in a nutshell. CoRR abs/2108.12552 (2021) - 2020
- [j37]Giorgi Japaridze:
Fundamentals of Computability Logic. FLAP 7(6): 1115-1176 (2020)
2010 – 2019
- 2019
- [i30]Giorgi Japaridze:
Computability logic: Giving Caesar what belongs to Caesar. CoRR abs/1902.05172 (2019) - [i29]Giorgi Japaridze:
Elementary-base cirquent calculus II: Choice quantifiers. CoRR abs/1902.07123 (2019) - [i28]Giorgi Japaridze:
Fundamentals of computability logic. CoRR abs/1904.01431 (2019) - 2018
- [j36]Giorgi Japaridze:
Elementary-base Cirquent Calculus I: Parallel and Choice Connectives. FLAP 5(1): 367-388 (2018) - 2017
- [i27]Giorgi Japaridze:
Elementary-base cirquent calculus I: Parallel and choice connectives. CoRR abs/1707.04823 (2017) - 2016
- [j35]Giorgi Japaridze:
Build your own clarithmetic I. Log. Methods Comput. Sci. 12(3) (2016) - [j34]Giorgi Japaridze:
Build your own clarithmetic II. Log. Methods Comput. Sci. 12(3) (2016) - [j33]Giorgi Japaridze:
Introduction to clarithmetic II. Inf. Comput. 247: 290-312 (2016) - [i26]Giorgi Japaridze:
A survey of computability logic. CoRR abs/1612.04513 (2016) - 2015
- [j32]Giorgi Japaridze:
On the system CL12 of computability logic. Log. Methods Comput. Sci. 11(3) (2015) - 2014
- [j31]Giorgi Japaridze:
Introduction to clarithmetic III. Ann. Pure Appl. Log. 165(1): 241-252 (2014) - 2013
- [j30]Giorgi Japaridze:
The taming of recurrences in computability logic through cirquent calculus, Part I. Arch. Math. Log. 52(1-2): 173-212 (2013) - [j29]Giorgi Japaridze:
The taming of recurrences in computability logic through cirquent calculus, Part II. Arch. Math. Log. 52(1-2): 213-259 (2013) - [i25]Giorgi Japaridze:
On resources and tasks. CoRR abs/1312.3372 (2013) - 2012
- [j28]Giorgi Japaridze
:
Separating the basic logics of the basic recurrences. Ann. Pure Appl. Log. 163(3): 377-389 (2012) - [j27]Giorgi Japaridze:
A new face of the branching recurrence of computability logic. Appl. Math. Lett. 25(11): 1585-1589 (2012) - [j26]Giorgi Japaridze:
A logical basis for constructive systems. J. Log. Comput. 22(3): 605-642 (2012) - 2011
- [j25]Giorgi Japaridze:
From formulas to cirquents in computability logic. Log. Methods Comput. Sci. 7(2) (2011) - [j24]Giorgi Japaridze:
Introduction to clarithmetic I. Inf. Comput. 209(10): 1312-1354 (2011) - [j23]Giorgi Japaridze:
Toggling operators in computability logic. Theor. Comput. Sci. 412(11): 971-1004 (2011) - [i24]Giorgi Japaridze:
A new face of the branching recurrence of computability logic. CoRR abs/1102.1054 (2011) - [i23]Giorgi Japaridze:
The taming of recurrences in computability logic through cirquent calculus. CoRR abs/1105.3853 (2011) - [i22]Giorgi Japaridze:
The taming of recurrences in computability logic through cirquent calculus, Part II. CoRR abs/1106.3705 (2011) - 2010
- [j22]Giorgi Japaridze:
Towards applied theories based on computability logic. J. Symb. Log. 75(2): 565-601 (2010) - [i21]Giorgi Japaridze:
A logical basis for constructive systems. CoRR abs/1003.0425 (2010) - [i20]Giorgi Japaridze:
Introduction to clarithmetic I. CoRR abs/1003.4719 (2010) - [i19]Giorgi Japaridze:
Introduction to clarithmetic II. CoRR abs/1004.3236 (2010) - [i18]Giorgi Japaridze:
Separating the basic logics of the basic recurrences. CoRR abs/1007.1324 (2010) - [i17]Giorgi Japaridze:
Introduction to clarithmetic III. CoRR abs/1008.0770 (2010)
2000 – 2009
- 2009
- [j21]Giorgi Japaridze:
Many Concepts and Two Logics of Algorithmic Reduction. Stud Logica 91(1): 1-24 (2009) - [p1]Giorgi Japaridze:
In the Beginning was Game Semantics? Games: Unifying Logic, Language, and Philosophy 2009: 249-350 - [i16]Giorgi Japaridze:
Ptarithmetic. CoRR abs/0902.2969 (2009) - [i15]Giorgi Japaridze:
Toggling operators in computability logic. CoRR abs/0904.3469 (2009) - 2008
- [j20]Giorgi Japaridze:
Sequential operators in computability logic. Inf. Comput. 206(12): 1443-1475 (2008) - [j19]Giorgi Japaridze:
Cirquent Calculus Deepened. J. Log. Comput. 18(6): 983-1028 (2008) - [i14]Giorgi Japaridze:
Towards applied theories based on computability logic. CoRR abs/0805.3521 (2008) - 2007
- [j18]Giorgi Japaridze:
Intuitionistic computability logic. Acta Cybern. 18(1): 77-113 (2007) - [j17]Giorgi Japaridze:
The intuitionistic fragment of computability logic at the propositional level. Ann. Pure Appl. Log. 147(3): 187-227 (2007) - [j16]Giorgi Japaridze:
The logic of interactive Turing reduction. J. Symb. Log. 72(1): 243-276 (2007) - [j15]Giorgi Japaridze:
From truth to computability II. Theor. Comput. Sci. 379(1-2): 20-52 (2007) - [i13]Giorgi Japaridze:
Four concepts and two logics of algorithmic reduction. CoRR abs/0706.0103 (2007) - [i12]Giorgi Japaridze:
Cirquent calculus deepened. CoRR abs/0709.1308 (2007) - [i11]Giorgi Japaridze:
Sequential operators in computability logic. CoRR abs/0712.1345 (2007) - 2006
- [j14]Giorgi Japaridze:
Introduction to Cirquent Calculus and Abstract Resource Semantics. J. Log. Comput. 16(4): 489-532 (2006) - [j13]Giorgi Japaridze:
From truth to computability I. Theor. Comput. Sci. 357(1-3): 100-135 (2006) - [j12]Giorgi Japaridze:
Propositional computability logic I. ACM Trans. Comput. Log. 7(2): 302-330 (2006) - [j11]Giorgi Japaridze:
Propositional computability logic II. ACM Trans. Comput. Log. 7(2): 331-362 (2006) - [i10]Giorgi Japaridze:
The intuitionistic fragment of computability logic at the propositional level. CoRR abs/cs/0602011 (2006) - 2005
- [i9]Giorgi Japaridze:
From truth to computability II. CoRR abs/cs/0501031 (2005) - [i8]Giorgi Japaridze:
In the beginning was game semantics. CoRR abs/cs/0507045 (2005) - [i7]Giorgi Japaridze:
The logic of interactive Turing reduction. CoRR abs/cs/0512100 (2005) - [i6]Giorgi Japaridze:
Introduction to Cirquent Calculus and Abstract Resource Semantics. CoRR abs/math/0506553 (2005) - 2004
- [i5]Giorgi Japaridze:
Propositional computability logic I. CoRR cs.LO/0404023 (2004) - [i4]Giorgi Japaridze:
Computability Logic: a formal theory of interaction. CoRR cs.LO/0404024 (2004) - [i3]Giorgi Japaridze:
Propositional Computability Logic II. CoRR cs.LO/0406037 (2004) - [i2]Giorgi Japaridze:
From truth to computability I. CoRR cs.LO/0407054 (2004) - [i1]Giorgi Japaridze:
Intuitionistic computability logic I. CoRR cs.LO/0411008 (2004) - 2003
- [j10]Giorgi Japaridze:
Introduction to computability logic. Ann. Pure Appl. Log. 123(1-3): 1-99 (2003) - 2002
- [j9]Giorgi Japaridze:
The logic of tasks. Ann. Pure Appl. Log. 117(1-3): 261-293 (2002) - 2000
- [j8]Giorgi Japaridze:
The Propositional Logic of Elementary Tasks. Notre Dame J. Formal Log. 41(2): 171-183 (2000)
1990 – 1999
- 1997
- [j7]Giorgi Japaridze:
A Constructive Game Semantics for the Language of Linear Logic. Ann. Pure Appl. Log. 85(2): 87-156 (1997) - 1994
- [j6]Giorgie Dzhaparidze:
The Logic of Arithmetical Hierarchy. Ann. Pure Appl. Log. 66(2): 89-112 (1994) - [j5]Giorgi Japaridze:
A Simple Proof of Arithmetical Completeness for Π1-conservativity Logic. Notre Dame J. Formal Log. 35(3): 346-354 (1994) - 1993
- [j4]Giorgie Dzhaparidze:
A Generalized Notion of Weak Interpretability and the Corresponding Modal Logic. Ann. Pure Appl. Log. 61(1-2): 113-160 (1993) - 1991
- [j3]Giorgie Dzhaparidze:
Predicate provability logic with non-modalized quantifiers. Stud Logica 50(1): 149-160 (1991) - 1990
- [j2]Sergei N. Artëmov, Giorgie Dzhaparidze:
Finite Kripke Models and Predicate Logics of Provability. J. Symb. Log. 55(3): 1090-1098 (1990) - [j1]Giorgie Dzhaparidze:
Decidable and enumerable predicate logics of provability. Stud Logica 49(1): 7-21 (1990)
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-12-12 21:57 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:
