default search action
Akito Tsuboi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j28]Hirotaka Kikyo, Akito Tsuboi:
Dividing and forking in random hypergraphs. Ann. Pure Appl. Log. 176(2): 103521 (2025) - 2021
- [j27]Kota Takeuchi, Akito Tsuboi:
On the number of independent orders. Ann. Pure Appl. Log. 172(2): 102886 (2021) - 2020
- [j26]Akito Tsuboi
:
Nonstandard methods for finite structures. Math. Log. Q. 66(3): 367-372 (2020)
2010 – 2019
- 2015
- [j25]Yu-ichi Tanaka, Akito Tsuboi:
A construction of real closed fields. Math. Log. Q. 61(3): 159-168 (2015) - [j24]Kota Takeuchi, Yu-ichi Tanaka, Akito Tsuboi:
Model companions of theories of graphs. Math. Log. Q. 61(3): 236-246 (2015) - 2012
- [j23]Kota Takeuchi, Akito Tsuboi:
On the existence of indiscernible trees. Ann. Pure Appl. Log. 163(12): 1891-1902 (2012)
2000 – 2009
- 2009
- [j22]Koichiro Ikeda, Hirotaka Kikyo
On generic structures with a strong amalgamation property. J. Symb. Log. 74(3): 721-733 (2009) - 2008
- [j21]Byunghan Kim, Alexei S. Kolesnikov, Akito Tsuboi:
Generalized amalgamation and n-simplicity. Ann. Pure Appl. Log. 155(2): 97-114 (2008) - [j20]Makoto Kobayashi, Akito Tsuboi:
A note on stationarity of types over models in simple theories. Math. Log. Q. 54(6): 625-628 (2008) - [j19]Akito Tsuboi:
Models Omitting Given Complete Types. Notre Dame J. Formal Log. 49(4): 393-399 (2008) - 2007
- [j18]Kazuma Ikeda, Akito Tsuboi:
Nonstandard models that are definable in models of Peano Arithmetic. Math. Log. Q. 53(1): 27-37 (2007) - 2004
- [j17]Masanori Itai, Akito Tsuboi, Kentaro Wakai:
Construction of saturated quasi-minimal structure. J. Symb. Log. 69(1): 9-22 (2004) - 2003
- [j16]Masahiko Murakami, Akito Tsuboi:
Expanding the additive reduct of a model of Peano arithmetic. Math. Log. Q. 49(4): 363-368 (2003) - [j15]Kenji Fukuzaki, Akito Tsuboi:
Implicit Definability of Subfields. Notre Dame J. Formal Log. 44(4): 217-225 (2003) - 2002
- [j14]Saharon Shelah
Definability of Initial Segments. Notre Dame J. Formal Log. 43(2): 65-73 (2002) - 2001
- [j13]Akito Tsuboi:
Random Amalgamation of Simple Theories. Math. Log. Q. 47(1): 45-50 (2001)
1990 – 1999
- 1998
- [j12]Koichiro Ikeda, Anand Pillay, Akito Tsuboi:
On Theories Having Three Countable Models. Math. Log. Q. 44: 161-166 (1998) - [j11]Akito Tsuboi, Kentaro Wakai:
On Interpretability of Almost Linear Orderings. Notre Dame J. Formal Log. 39(3): 325-331 (1998) - 1997
- [j10]Anand Pillay, Akito Tsuboi:
Amalgamations Preserving aleph0-Categoricity. J. Symb. Log. 62(4): 1070-1074 (1997) - 1995
- [j9]Akito Tsuboi, Koichiro Ikeda:
Almost Total Elementary Maps. Math. Log. Q. 41: 353-361 (1995) - 1994
- [j8]Hirotaka Kikyo, Akito Tsuboi:
On Reduction Properties. J. Symb. Log. 59(3): 900-911 (1994) - 1993
- [j7]Akito Tsuboi:
Algebraic Types and Automorphism Groups. J. Symb. Log. 58(1): 232-239 (1993) - 1992
- [j6]Akito Tsuboi:
On Definability of Normal Subgroups of a Superstable Group. Math. Log. Q. 38(1): 101-106 (1992)
1980 – 1989
- 1988
- [j5]Akito Tsuboi:
On a property of ω-stable solvable groups. Arch. Math. Log. 27(2): 193-197 (1988) - [j4]Akito Tsuboi:
Strongly 2-Dimensional Theories. J. Symb. Log. 53(3): 931-936 (1988) - 1987
- [j3]Akito Tsuboi:
Categoricity and Non-Orthogonality of Types. Math. Log. Q. 33(4): 335-338 (1987) - 1985
- [j2]Akito Tsuboi:
On Theories Having a Finite Number of Nonisomorphic Countable Models. J. Symb. Log. 50(3): 806-808 (1985) - [j1]Akito Tsuboi:
On the Number of Independent Partitions. J. Symb. Log. 50(3): 809-814 (1985)
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-10-30 20:30 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: