Giorgi Japaridze

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j25		Giorgi Japaridze: The taming of recurrences in computability logic through cirquent calculus, Part I. Arch. Math. Log. 52(1-2): 173-212 (2013)
j24		Giorgi Japaridze: The taming of recurrences in computability logic through cirquent calculus, Part II. Arch. Math. Log. 52(1-2): 213-259 (2013)
	2012
j23		Giorgi Japaridze: Separating the basic logics of the basic recurrences. Ann. Pure Appl. Logic 163(3): 377-389 (2012)
j22		Giorgi Japaridze: A new face of the branching recurrence of computability logic. Appl. Math. Lett. 25(11): 1585-1589 (2012)
j21		Giorgi Japaridze: A logical basis for constructive systems. J. Log. Comput. 22(3): 605-642 (2012)
i24		Giorgi Japaridze: On the system CL12 of computability logic. CoRR abs/1203.0103 (2012)
	2011
j20		Giorgi Japaridze: From formulas to cirquents in computability logic. Logical Methods in Computer Science 7(2) (2011)
j19		Giorgi Japaridze: Introduction to clarithmetic I. Inf. Comput. 209(10): 1312-1354 (2011)
j18		Giorgi Japaridze: Toggling operators in computability logic. Theor. Comput. Sci. 412(11): 971-1004 (2011)
i23		Giorgi Japaridze: A new face of the branching recurrence of computability logic. CoRR abs/1102.1054 (2011)
i22		Giorgi Japaridze: The taming of recurrences in computability logic through cirquent calculus. CoRR abs/1105.3853 (2011)
i21		Giorgi Japaridze: The taming of recurrences in computability logic through cirquent calculus, Part II. CoRR abs/1106.3705 (2011)
	2010
j17		Giorgi Japaridze: Towards applied theories based on computability logic. J. Symb. Log. 75(2): 565-601 (2010)
i20		Giorgi Japaridze: A logical basis for constructive systems. CoRR abs/1003.0425 (2010)
i19		Giorgi Japaridze: Introduction to clarithmetic I. CoRR abs/1003.4719 (2010)
i18		Giorgi Japaridze: Introduction to clarithmetic II. CoRR abs/1004.3236 (2010)
i17		Giorgi Japaridze: Separating the basic logics of the basic recurrences. CoRR abs/1007.1324 (2010)
i16		Giorgi Japaridze: Introduction to clarithmetic III. CoRR abs/1008.0770 (2010)
	2009
j16		Giorgi Japaridze: Many Concepts and Two Logics of Algorithmic Reduction. Studia Logica 91(1): 1-24 (2009)
p1		Giorgi Japaridze: In the Beginning was Game Semantics? Games: Unifying Logic, Language, and Philosophy 2009: 249-350
i15		Giorgi Japaridze: Ptarithmetic. CoRR abs/0902.2969 (2009)
i14		Giorgi Japaridze: Toggling operators in computability logic. CoRR abs/0904.3469 (2009)
	2008
j15		Giorgi Japaridze: Sequential operators in computability logic. Inf. Comput. 206(12): 1443-1475 (2008)
j14		Giorgi Japaridze: Cirquent Calculus Deepened. J. Log. Comput. 18(6): 983-1028 (2008)
i13		Giorgi Japaridze: Towards applied theories based on computability logic. CoRR abs/0805.3521 (2008)
	2007
j13		Giorgi Japaridze: Intuitionistic computability logic. Acta Cybern. 18(1): 77-113 (2007)
j12		Giorgi Japaridze: The intuitionistic fragment of computability logic at the propositional level. Ann. Pure Appl. Logic 147(3): 187-227 (2007)
j11		Giorgi Japaridze: The logic of interactive Turing reduction. J. Symb. Log. 72(1): 243-276 (2007)
j10		Giorgi Japaridze: From truth to computability II. Theor. Comput. Sci. 379(1-2): 20-52 (2007)
i12		Giorgi Japaridze: Four concepts and two logics of algorithmic reduction. CoRR abs/0706.0103 (2007)
i11		Giorgi Japaridze: Cirquent calculus deepened. CoRR abs/0709.1308 (2007)
i10		Giorgi Japaridze: Sequential operators in computability logic. CoRR abs/0712.1345 (2007)
	2006
j9		Giorgi Japaridze: Introduction to Cirquent Calculus and Abstract Resource Semantics. J. Log. Comput. 16(4): 489-532 (2006)
j8		Giorgi Japaridze: From truth to computability I. Theor. Comput. Sci. 357(1-3): 100-135 (2006)
j7		Giorgi Japaridze: Propositional computability logic I. ACM Trans. Comput. Log. 7(2): 302-330 (2006)
j6		Giorgi Japaridze: Propositional computability logic II. ACM Trans. Comput. Log. 7(2): 331-362 (2006)
i9		Giorgi Japaridze: The intuitionistic fragment of computability logic at the propositional level. CoRR abs/cs/0602011 (2006)
	2005
i8		Giorgi Japaridze: From truth to computability II. CoRR abs/cs/0501031 (2005)
i7		Giorgi Japaridze: In the beginning was game semantics. CoRR abs/cs/0507045 (2005)
i6		Giorgi Japaridze: The logic of interactive Turing reduction. CoRR abs/cs/0512100 (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
j5		Giorgi Japaridze: Introduction to computability logic. Ann. Pure Appl. Logic 123(1-3): 1-99 (2003)
	2002
j4		Giorgi Japaridze: The logic of tasks. Ann. Pure Appl. Logic 117(1-3): 261-293 (2002)
	2000
j3		Giorgi Japaridze: The Propositional Logic of Elementary Tasks. Notre Dame Journal of Formal Logic 41(2): 171-183 (2000)
	1997
j2		Giorgi Japaridze: A Constructive Game Semantics for the Language of Linear Logic. Ann. Pure Appl. Logic 85(2): 87-156 (1997)
	1994
j1		Giorgi Japaridze: A Simple Proof of Arithmetical Completeness for Pi₁-conservativity Logic. Notre Dame Journal of Formal Logic 35(3): 346-354 (1994)

Last update Thu May 23 18:40:51 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page